201 search results - page 32 / 41 » New Structural Decomposition Techniques for Constraint Satis... |
KBSE
2002
IEEE
15 years 4 months ago
2002
IEEE
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
NHM
2010
14 years 6 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
83
Voted
ICML
1997
IEEE
16 years 14 days ago
1997
IEEE
Abstract: We investigate the structure of model selection problems via the bias/variance decomposition. In particular, we characterize the essential structure of a model selection ...
SCP
1998
14 years 11 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
102
Voted
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
- Stable and effective enforcement of hard constraints is one of the crucial components in controlling physics-based dynamic simulation systems. The conventional explicit Baumgarte...