competitive ratio |
4 |
algorithm design |
3 |
auction |
3 |
auction mechanism design |
3 |
benchmarking |
3 |
cloud computing |
3 |
cognitive radio network |
3 |
computer networks |
3 |
data transfer |
3 |
dynamic load balancing |
3 |
dynamic scheduling |
3 |
ip networks |
3 |
iterative distributed operation |
3 |
key dependency |
3 |
linear programming |
3 |
minimization |
3 |
mobile radio |
3 |
monotone hazard rate |
3 |
network functions virtualization |
3 |
online algorithms |
3 |
online auction |
3 |
online selling |
3 |
openmosix |
3 |
partitioning |
3 |
pricing |
3 |
radio networks |
3 |
resource allocation |
3 |
resource management |
3 |
servers |
3 |
shuffle |
3 |
spark |
3 |
time varying systems |
3 |
transport protocols |
3 |
truthful mechanisms |
3 |
3d printing |
2 |
adaptative load balancing |
2 |
adaptive cache coherence protocol |
2 |
arrival patterns |
2 |
auction mechanisms |
2 |
bandwidth availability |
2 |
big data |
2 |
bulk data transfers |
2 |
capacity allocation |
2 |
channel label |
2 |
client server |
2 |
cloud platforms |
2 |
cloud services |
2 |
cluster |
2 |
cluster computing |
2 |
clustering computing |
2 |
cognitive radio ad-hoc networks |
2 |
coherence protocol |
2 |
combinatorial auction |
2 |
communication |
2 |
communications technology |
2 |
component-based system |
2 |
computation paradigms |
2 |
computation-intensive task |
2 |
computer aided design |
2 |
computer applications |
2 |
computer gaming |
2 |
computer hardware |
2 |
computers |
2 |
computers and information processing |
2 |
computing capacity |
2 |
computing paradigm |
2 |
computing technology |
2 |
conflicting area |
2 |
connectivity problems |
2 |
content distribution |
2 |
content distribution systems |
2 |
content migration |
2 |
content providers |
2 |
context-aware |
2 |
cooperative caching |
2 |
credit-based system |
2 |
cross-layer coordination |
2 |
cube-connected cycles |
2 |
data aggregation |
2 |
data centers |
2 |
data dissemination |
2 |
delegation |
2 |
demand prediction |
2 |
distributed implementation |
2 |
distributed java virtual machine |
2 |
distributed shared memory |
2 |
distributed virtual environment |
2 |
distributed web servers |
2 |
distribution algorithms |
2 |
document replication and distribution |
2 |
double auction |
2 |
dynamic algorithm |
2 |
dynamic content |
2 |
dynamic demand |
2 |
dynamic memory mapping mechanism |
2 |
dynamic migration |
2 |
dynamic resource trading |
2 |
economic constraints |
2 |
efficient scheduling |
2 |
electricity prices |
2 |
embedding |
2 |
empirical studies |
2 |
fast neighbor discovery |
2 |
federated cloud |
2 |
file sharing |
2 |
fixed horizons |
2 |
gamelet |
2 |
garbage collection |
2 |
geo-distributed clouds |
2 |
geo-distributed datacenters |
2 |
geographical locations |
2 |
global object space |
2 |
grid |
2 |
home-based cache coherence protocol |
2 |
home-based protocol |
2 |
hot object |
2 |
hybrid cloud |
2 |
hybrid clouds |
2 |
identifier |
2 |
incentive |
2 |
indexing overlay |
2 |
individual profit |
2 |
interactive computer systems |
2 |
interconnection networks |
2 |
java |
2 |
java virtual machine |
2 |
jessica |
2 |
jump |
2 |
just-in-time compiler |
2 |
jvm |
2 |
large object space |
2 |
latency-energy tradeoff |
2 |
linux |
2 |
local information |
2 |
long-term profits |
2 |
lyapunov optimization |
2 |
management of virtual memory |
2 |
memory consistency model |
2 |
middleware |
2 |
migrating-home protocol |
2 |
minimum latency |
2 |
minimum-latency |
2 |
mobile agent |
2 |
mobile computing |
2 |
mobile music making |
2 |
mobile tv |
2 |
mobility support |
2 |
mpi |
2 |
multi-head slicing |
2 |
multicomputers |
2 |
multiple radios |
2 |
multiple-objective optimization |
2 |
music collaboration |
2 |
neighbor discovery |
2 |
non-conflicting area |
2 |
object oriented programming |
2 |
on-line algorithms |
2 |
optimal decision making |
2 |
optimal scheduling |
2 |
optimization techniques |
2 |
p2p streaming |
2 |
peer-to-peer |
2 |
peer-to-peer content distribution |
2 |
peer-to-peer network |
2 |
peer-to-peer streaming |
2 |
physical interference model |
2 |
physical page |
2 |
pre-emptive scheduling |
2 |
private clouds |
2 |
process migration |
2 |
processors - memory management |
2 |
programming models |
2 |
queueing network |
2 |
rendezvous algorithms |
2 |
replacement algorithms |
2 |
request distribution |
2 |
resource access |
2 |
rigorous analysis |
2 |
routing |
2 |
scheduling |
2 |
secondary networks |
2 |
security |
2 |
service-oriented framework |
2 |
single system image |
2 |
social improvisation |
2 |
social media |
2 |
social welfare |
2 |
social welfare maximization |
2 |
software engineering |
2 |
software-defined networking |
2 |
solid modeling |
2 |
spectrum allocation |
2 |
state management |
2 |
stochastic optimization |
2 |
storage management - allocation deallocation strategies |
2 |
successive interference cancellation |
2 |
task completion time |
2 |
telecommunication services |
2 |
temporal availability |
2 |
the world wide web |
2 |
thread migration |
2 |
traffic locality |
2 |
transmitting data |
2 |
trust |
2 |
tv |
2 |
ubiquitous computing |
2 |
video conferencing |
2 |
video-on-demand |
2 |
virtual hairy brush |
2 |
virtual machine trading |
2 |
virtual machines |
2 |
vlsi |
2 |
web object cache |
2 |
wireless sensor network |
2 |
wireless sensor networks |
2 |
004.35 c52 |
1 |
004.35 e27 |
1 |
004.35 x8 c1 |
1 |
004.36 x8 |
1 |
004.65 c52 |
1 |
004.65 l36 |
1 |
004.65 t88 |
1 |
abstract mac layer |
1 |
ad hoc and sensor networks |
1 |
ad hoc networks |
1 |
adaptive fault-tolerant routing |
1 |
algorithm |
1 |
algorithmic problems |
1 |
algorithms |
1 |
all-to-all broadcast |
1 |
analysis of algorithms |
1 |
approximation algorithm |
1 |
approximation algorithms |
1 |
approximation ratios |
1 |
approximation theory |
1 |
arbitrary number |
1 |
arithmetic circuit |
1 |
articulation point |
1 |
bandwidth allocation |
1 |
biomedical image search |
1 |
broadcast algorithm |
1 |
broadcast protocols |
1 |
broadcasting algorithm |
1 |
butterfly graph |
1 |
cache resource allocation (緩存資源分配) |
1 |
cayley graph |
1 |
chinese calligraphy |
1 |
club theory |
1 |
coflow |
1 |
cognitive radio networks |
1 |
collective communication |
1 |
collective planning |
1 |
collision detection |
1 |
coloring |
1 |
combinatorial optimization |
1 |
commodity eye-tracking |
1 |
communication collision |
1 |
communication optimization |
1 |
compact routing |
1 |
compacting garbage collection |
1 |
complexity |
1 |
computational complexity |
1 |
computational complexity. |
1 |
computational geometry |
1 |
computer algorithms. |
1 |
computer architecture |
1 |
computer capacity. |
1 |
computer engineering |
1 |
computer network architectures. |
1 |
computer network protocols. |
1 |
computer networks. |
1 |
computer systems |
1 |
computers - computer engineering |
1 |
computers - computer graphics |
1 |
connected dominating set |
1 |
consecutive ones |
1 |
constraint satisfaction problem |
1 |
content adaptation |
1 |
content delivery networks (cdn) (內容分發網絡) |
1 |
content negotiation |
1 |
content-based image retrieval |
1 |
context awareness |
1 |
coordination generalized molecule model (cgmm) |
1 |
coordination generalized particle model (c-gpm) |
1 |
cost-benefit analysis |
1 |
counting |
1 |
counting problems |
1 |
coverage |
1 |
critical problems |
1 |
data collection |
1 |
data parallelism |
1 |
datacenter networks |
1 |
de bruijn graph |
1 |
deadlock freedom |
1 |
decision engine |
1 |
decoding |
1 |
demodulation |
1 |
diffusion method |
1 |
digital control systems |
1 |
digital painting and calligraphy |
1 |
dilation |
1 |
directed graph |
1 |
disjoint fault-connected region |
1 |
disjoint fault-connected regions |
1 |
distance vector |
1 |
distributed algorithm |
1 |
distributed algorithms |
1 |
distributed and parallel algorithm |
1 |
distributed and parallel algorithm (分布并行算法) |
1 |
distributed and parallel computing |
1 |
distributed parallel algorithm |
1 |
distributed planning |
1 |
distributed scheduling |
1 |
distributed systems |
1 |
document |
1 |
document summarization |
1 |
dynamic network |
1 |
dynamic programming |
1 |
dynamic sensor resource allocation problem |
1 |
dynamic wireless network |
1 |
dynamic wireless networks |
1 |
dynamical process |
1 |
economic generalized particle model (egpm) |
1 |
edge computing |
1 |
electronic data processing |
1 |
electronic data processing -- distributed processing. |
1 |
embedded systems |
1 |
energy complexity |
1 |
energy consumption |
1 |
energy efficiency |
1 |
esthetic computing |
1 |
evolutionary algorithm |
1 |
evolutionary algorithm (ea) |
1 |
evolutionary swarm optimization |
1 |
extensive simulations |
1 |
facial expressions |
1 |
fault-tolerant wormhole routing |
1 |
game particle-field (博弈粒子場) |
1 |
gaze positions |
1 |
general sweeping operation |
1 |
generalized particle (gp) |
1 |
generalized particle models (gpm) |
1 |
generator |
1 |
generic generalized particle model (ge-gpm) |
1 |
global clocks |
1 |
gossiping |
1 |
graph embedding |
1 |
graph theory |
1 |
graph theory. |
1 |
grid computing |
1 |
hadoop |
1 |
hamiltonicity |
1 |
heterogeneous interference |
1 |
heterogeneous sensing capability |
1 |
hierarchical modulation (hm) |
1 |
high probability |
1 |
human factors in information retrieval |
1 |
image and video recommendation |
1 |
implicit user feedback |
1 |
inclusion-exclusion |
1 |
inclusion-exclusion principle |
1 |
index |
1 |
information dissemination |
1 |
information exchange |
1 |
intelligent bandwidth allocation |
1 |
intelligent cad |
1 |
intelligent system for art |
1 |
interconnection network |
1 |
interference |
1 |
interference control |
1 |
interference minimization |
1 |
interference models |
1 |
interval routing |
1 |
interval routing schemes |
1 |
isomorphism |
1 |
jamming |
1 |
k-dominating set |
1 |
k-k routing |
1 |
kinematics and dynamics |
1 |
latency |
1 |
learning (artificial intelligence) |
1 |
learning from online examples |
1 |
learning to rank videos |
1 |
link scheduling |
1 |
load balancing |
1 |
load rebalancing |
1 |
local broadcasting |
1 |
location problem |
1 |
lower bounds |
1 |
machine learning |
1 |
mapreduce |
1 |
mark compact |
1 |
markov decision process |
1 |
matching |
1 |
mesh |
1 |
mesh multiprocessors |
1 |
mesh-connected computers |
1 |
meshes |
1 |
meshes with buses |
1 |
message-passing multiprocessors k-ary n-cube networks |
1 |
midimew networks |
1 |
mimd |
1 |
modulation |
1 |
multi-channel wireless network |
1 |
multi-modality video similarity fusion |
1 |
multi-objective optimization |
1 |
multi-phase minimal path |
1 |
multi-sensor fusion |
1 |
multimedia information retrieval |
1 |
multiple channels |
1 |
multiple-message broadcast |
1 |
multiprocessor |
1 |
multiset multicover |
1 |
nature-inspired algorithm |
1 |
network protocols |
1 |
network scheduling |
1 |
networks |
1 |
neural combinatorial optimization |
1 |
non-photorealistic rendering |
1 |
np-completeness |
1 |
obstacles |
1 |
online algorithm |
1 |
online browsing and navigation |
1 |
online reference image collection |
1 |
operating system |
1 |
operating systems (computers) |
1 |
p-median |
1 |
packing problem |
1 |
parallel algorithms |
1 |
parallel and distributed systems |
1 |
parallel computers |
1 |
parallel computers. |
1 |
parallel processing |
1 |
parallel processing (electronic computers) |
1 |
parameterized problems |
1 |
parity check codes |
1 |
particle mechanics model |
1 |
pci |
1 |
performance modeling |
1 |
performance optimization |
1 |
permutation routing |
1 |
personal preferences |
1 |
personalized discourse abstract |
1 |
personalized document summarization |
1 |
personalized recommendation and ranking |
1 |
personalized video ranking |
1 |
pervasive computing |
1 |
physical carrier sensing |
1 |
physical-layer network coding (pnc) |
1 |
pigments |
1 |
planar graphs |
1 |
polynomial factor |
1 |
polynomial space |
1 |
pre-adaptation |
1 |
price and demands dynamic modulation |
1 |
probabilistic analysis |
1 |
process pre-emption |
1 |
quadrature amplitude modulation |
1 |
query processing |
1 |
queueing theory |
1 |
raid |
1 |
raid matrix |
1 |
raid-m |
1 |
randomized algorithm |
1 |
reading durations |
1 |
reading preference |
1 |
real-time computing |
1 |
real-time control. |
1 |
real-time simulation |
1 |
regular graph |
1 |
reinforcement learning |
1 |
relays |
1 |
rendezvous |
1 |
repositioning |
1 |
retrieving unannotated images |
1 |
ride-hailing |
1 |
routing algorithm |
1 |
routing information protocol |
1 |
routing with locality |
1 |
scheduling algorithms |
1 |
scheduling complexity |
1 |
semi space |
1 |
sensor behavior |
1 |
sensor coordination |
1 |
sensor networks |
1 |
service delivery |
1 |
set multi-covering |
1 |
set multicover |
1 |
shuffle-exchange network |
1 |
simulation algorithm |
1 |
single hop |
1 |
sinr |
1 |
sinr interference model |
1 |
sinr model |
1 |
skew space |
1 |
social behavior |
1 |
social coordination |
1 |
social networks (sn) |
1 |
software |
1 |
software-as-aservice (saas) |
1 |
space efficiency |
1 |
storage |
1 |
swarm intelligence |
1 |
symbols |
1 |
synchronous computations |
1 |
termination detection |
1 |
topology control |
1 |
total exchange |
1 |
transputers. |
1 |
two-way relay channel (twrc |
1 |
ultra-wideband |
1 |
undirectional link |
1 |
unstructured wireless networks |
1 |
user attention |
1 |
user feedback |
1 |
user preferences |
1 |
user-oriented document summarization |
1 |
video similarity estimation |
1 |
virtual channel |
1 |
virtual memory |
1 |
virtualization |
1 |
visual search interface |
1 |
waterflow particle mechanics model |
1 |
web information retrieval |
1 |
web search |
1 |
web search mining |
1 |
web service |
1 |
wireless |
1 |
wireless ad hoc networks |
1 |
wireless ad-hoc |
1 |
wireless ad-hoc and sensor networks |
1 |
wireless communications |
1 |
wireless link scheduling |
1 |
wireless network |
1 |
wireless sensor networks - research. |
1 |
wormhole routing |
1 |
writing primitive |
1 |
yarn |
1 |