830 search results - page 123 / 166 » Generalizing Global Constraints Based on Network Flows |
IPM
2007
13 years 8 months ago
2007
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
TPDS
2008
13 years 8 months ago
2008
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
JSAC
2008
13 years 8 months ago
2008
In this paper, we generalize the random access game model, and show that it provides a general game-theoretic framework for designing contention based medium access control. We ext...
LPNMR
2009
Springer
2009
Springer
Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs
14 years 3 months ago
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility of field-programmable devices to customize architectures for paralle...
TON
2002
13 years 8 months ago
2002
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...