Sciweavers

205 search results - page 23 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
COR
2010
116views more  COR 2010»
13 years 8 months ago
The multi-shift vehicle routing problem with overtime
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut...
EC
2006
163views ECommerce» more  EC 2006»
13 years 8 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 10 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
BMCBI
2007
99views more  BMCBI 2007»
13 years 8 months ago
Stratification bias in low signal microarray studies
Background: When analysing microarray and other small sample size biological datasets, care is needed to avoid various biases. We analyse a form of bias, stratification bias, that...
Brian J. Parker, Simon Günter, Justin Bedo
CP
2000
Springer
14 years 28 days ago
Singleton Consistencies
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
Patrick Prosser, Kostas Stergiou, Toby Walsh