566 search results - page 41 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
108
Voted
AI
2003
Springer
15 years 5 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
109
click to vote
SPLC
2008
2008
Using Aspects and Component Concepts to Improve Reuse of Software for Embedded Systems Product Lines
15 years 1 months ago
Embedded systems have several characteristics, such as application specific needs, real-time constraints and intrinsic embedded concerns (i.e. energy consumption), which hinder th...
94
Voted
TPLP
2008
15 years 10 days ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
127
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
102
Voted
CONSTRAINTS
2008
15 years 16 days ago
2008
Camera control techniques for Interactive Digital Entertainment (IDE) are reaching their limits in terms of capabilities. To enable future growth, new methods must be derived to a...