Sciweavers

1140 search results - page 53 / 228
» Progress on Certifying Algorithms
Sort
View
SCHEDULING
2010
79views more  SCHEDULING 2010»
13 years 9 months ago
Open problems in real-time scheduling
Abstract We state some of the most important open algorithmic problems in real-time scheduling, and survey progress made on these problems since the 2009 Dagstuhl scheduling semina...
Sanjoy K. Baruah, Kirk Pruhs
GECCO
2003
Springer
114views Optimization» more  GECCO 2003»
14 years 4 months ago
Learning the Ideal Evaluation Function
Abstract. Designing an adequate fitness function requiressubstantial knowledge of a problem and of features that indicate progress towards a solution. Coevolution takes the human ...
Edwin D. de Jong, Jordan B. Pollack
AIPS
2010
14 years 1 months ago
Computing Applicability Conditions for Plans with Loops
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
14 years 24 days ago
The Multiplicative Quantum Adversary
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
Robert Spalek
CGF
1999
91views more  CGF 1999»
13 years 10 months ago
Efficient and Handy Texture Mapping on 3D Surfaces
There has been a rapid technical progress in three-dimensional (3D) computer graphics. But gathering surface and texture data is yet a laborious task. This paper addresses the pro...
Kenji Matsushita, Toyohisa Kaneko