1381 search results - page 108 / 277 » Computational Complexity of Constraint Satisfaction |
153
click to vote
CP
1997
Springer
15 years 8 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
162
click to vote
DSVIS
2006
Springer
15 years 8 months ago
2006
Springer
The development of video games is a complex software engineering activity bringing together large multidisciplinary teams under stringent constraints. While much has been written a...
156
click to vote
AGP
1999
IEEE
15 years 8 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
146
click to vote
IJAOSE
2010
15 years 2 months ago
2010
CASO is an agent-oriented programming language based on AgentSpeak(L), one of the most influential abstract languages based on the BDI (Beliefs-Desires-Intentions) architecture. ...
157
click to vote
EUC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. A dramatic increase of event monitoring capabilities by wireless sensors requires new, more sophisticated, event correlation over time and space. This new paradigm implie...