2725 search results - page 93 / 545 » Constraint Solving for Interpolation |
90
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
104
click to vote
FAC
2010
14 years 11 months ago
2010
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...
100
Voted
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
HM
2007
Springer
15 years 7 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 ...
112
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...