230 search results - page 18 / 46 » Constraint Orbital Branching |
CP
2008
Springer
13 years 9 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...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some d...
VLSID
2006
IEEE
14 years 1 months ago
2006
IEEE
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...
COR
2007
13 years 7 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
ESANN
2007
13 years 9 months ago
2007
We investigate in this paper the problem of model collisions in the Dissimilarity Self Organizing Map (SOM). This extension of the SOM to dissimilarity data suffers from constrain...