Sciweavers

2725 search results - page 108 / 545
» Constraint Solving for Interpolation
Sort
View
ATAL
2006
Springer
15 years 10 months ago
No-commitment branch and bound search for distributed constraint optimization
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...
Anton Chechetka, Katia P. Sycara
CP
2008
Springer
15 years 8 months ago
Exploiting Decomposition in Constraint Optimization Problems
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...
Matthew Kitching, Fahiem Bacchus
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
15 years 6 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
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...
Ryozo Nagamune, Anders Blomqvist
HEURISTICS
1998
252views more  HEURISTICS 1998»
15 years 6 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
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...
P. C. Chu, J. E. Beasley
TSP
2010
15 years 1 months ago
Efficient recursive estimators for a linear, time-varying Gaussian model with general constraints
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...
Stefan Uhlich, Bin Yang