Sciweavers

88 search results - page 15 / 18
» Efficient Randomized Algorithms for Input-Queued Switch Sche...
Sort
View
88
Voted
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
15 years 10 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
ENTCS
2006
113views more  ENTCS 2006»
14 years 9 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani
106
Voted
ECCV
2008
Springer
15 years 8 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
DAC
2009
ACM
15 years 10 months ago
Quality-driven synthesis of embedded multi-mode control systems
At runtime, an embedded control system can switch between alternative functional modes. In each mode, the system operates by using a schedule and controllers that exploit the avai...
Soheil Samii, Petru Eles, Zebo Peng, Anton Cervin
COMCOM
2004
110views more  COMCOM 2004»
14 years 9 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu