2725 search results - page 108 / 545 » Constraint Solving for Interpolation |
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
101
Voted
CP
2008
Springer
15 years 2 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...
102
click to vote
AUTOMATICA
2005
15 years 22 days ago
2005
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
HEURISTICS
1998
15 years 15 days ago
1998
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
114
Voted
TSP
2010
14 years 7 months ago
2010
The adaptive estimation of a time-varying parameter vector in a linear Gaussian model is considered where we a priori know that the parameter vector belongs to a known arbitrary s...