526 search results - page 20 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
91
Voted
EVOW
2007
Springer
15 years 3 months ago
2007
Springer
In recent years, there has been an increasing concern from the evolutionary computation community on dynamic optimization problems since many real-world optimization problems are t...
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
101
click to vote
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
102
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
JIRS
2006
14 years 9 months ago
2006
The paper presents a general framework for concurrent navigation and exploration of unknown environments based on discrete potential fields that guide the robot motion. These poten...