269 search results - page 24 / 54 » A branch and bound method for stochastic global optimization |
EMSOFT
2007
Springer
15 years 3 months ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
FGR
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper presents a novel approach to robust and flexible person tracking using an algorithm that combines two powerful stochastic modeling techniques: The first one is the tech...
CP
2008
Springer
14 years 11 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
HM
2007
Springer
15 years 3 months ago
2007
Springer
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web-scale prediction problems, it is increasingly comm...