Sciweavers

3433 search results - page 162 / 687
» Heuristics for a bidding problem
Sort
View
ICCAD
1997
IEEE
75views Hardware» more  ICCAD 1997»
15 years 10 months ago
An exact gate decomposition algorithm for low-power technology mapping
With the remarkable growth of portable application and the increasing frequency and integration density, power is being given comparable weight to speed and area in IC designs. In...
Hai Zhou, D. F. Wong
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
15 years 10 months ago
Mixing independent classifiers
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
Jan Drugowitsch, Alwyn Barry
AIPS
2010
15 years 9 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
HEURISTICS
2007
76views more  HEURISTICS 2007»
15 years 6 months ago
Metaheuristics can solve sudoku puzzles
: In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this ...
Rhyd Lewis
ECAL
2007
Springer
16 years 22 days ago
Near-Optimal Mobile Robot Recharging with the Rate-Maximizing Forager
We examine the practical problem of a mobile autonomous robot performing a long-duration survey task, during which it must recharge its batteries periodically. We present a scalabl...
Jens Wawerla, Richard T. Vaughan