2109 search results - page 386 / 422 » Solving Necklace Constraint Problems |
CP
2006
Springer
14 years 2 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
EUC
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Energy and delay are critical issues for wireless sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Due to the u...
CP
1995
Springer
14 years 2 months ago
1995
Springer
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
—Context, the pieces of information that capture the characteristics of ubiquitous computing environment, is often imprecise and incomplete due to user mobility, unreliable wirel...
EWCBR
2008
Springer
14 years 22 days ago
2008
Springer
The main goal of a Case-Based Reasoning (CBR) system is to provide criteria for evaluating the internal behavior and task efficiency of a particular system for a given initial case...