1453 search results - page 129 / 291 » Partial Constraint Satisfaction |
132
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
Direct reductions of partial differential equations to systems of ordinary differential equations are in one-to-one correspondence with compatible differential constraints. The dif...
136
click to vote
JFLP
2002
15 years 4 months ago
2002
We present a practical partial evaluation scheme for multi-paradigm declarative languages combining features from functional, logic, and concurrent programming. In contrast to pre...
140
click to vote
ACL
2001
15 years 5 months ago
2001
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
115
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
120
click to vote
IDEAL
2003
Springer
15 years 9 months ago
2003
Springer
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...