Sciweavers

1404 search results - page 10 / 281
» Complexity of admissible rules
Sort
View
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 4 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
14 years 12 days ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...
AAAI
2010
13 years 12 months ago
To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
Carmel Domshlak, Erez Karpas, Shaul Markovitch
GLOBECOM
2006
IEEE
14 years 4 months ago
Efficient Approximations for Call Admission Control Performance Evaluations in Multi-Service Networks
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
Emre A. Yavuz, Victor C. M. Leung