1483 search results - page 79 / 297 » Geometric constraint satisfaction using optimization methods |
JETAI
2007
15 years 1 months ago
2007
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
109
click to vote
AAAI
2004
15 years 2 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
102
click to vote
3DPVT
2002
IEEE
15 years 6 months ago
2002
IEEE
Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to ...
107
click to vote
CP
2008
Springer
15 years 3 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...
127
click to vote
CCCG
2010
15 years 2 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...