2725 search results - page 274 / 545 » Constraint Solving for Interpolation |
207
click to vote
CPAIOR
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
208
click to vote
ESA
2000
Springer
15 years 11 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
179
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOPs optimally with m...
190
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
210
click to vote
IJCAI
2003
15 years 8 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...