Sciweavers

608 search results - page 114 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 5 months ago
Intransitivity revisited coevolutionary dynamics of numbers games
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
Pablo Funes, Enrique Pujals
ICSM
2008
IEEE
15 years 6 months ago
Understanding the rationale for updating a function's comment
Up-to-date comments are critical for the successful evolution of a software application. When modifying a function, developers may update the comment associated with the function ...
Haroon Malik, Istehad Chowdhury, Hsiao-Ming Tsou, ...
INFOCOM
2010
IEEE
14 years 10 months ago
Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R....
116
Voted
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 6 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
91
Voted
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
15 years 12 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...