33 search results - page 4 / 7 » Solving Over-Constrained Temporal Reasoning Problems Using L... |
AISC
2004
Springer
14 years 27 days ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
EVOW
2006
Springer
13 years 11 months ago
2006
Springer
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
MP
2002
13 years 7 months ago
2002
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
ACG
2006
Springer
14 years 1 months ago
2006
Springer
Seki is a situation of coexistence in the game of Go, where neither player can profitably capture the opponent’s stones. This paper presents a new method for deciding whether an...
AAAI
1992
13 years 8 months ago
1992
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...