566 search results - page 53 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
117
click to vote
AISC
2008
Springer
15 years 2 months ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
106
Voted
TAPIA
2003
ACM
15 years 5 months ago
2003
ACM
We present a method for simulating rigid multibody dynamics with joints, contact, and friction. In this work, the nonsmooth contact and frictional constraints are represented by h...
88
Voted
WWW
2008
ACM
16 years 1 months ago
2008
ACM
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...
AAAI
1996
15 years 1 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
117
click to vote
PRICAI
2004
Springer
15 years 5 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...