805 search results - page 105 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
126
click to vote
ICCBR
1999
Springer
15 years 8 months ago
1999
Springer
In the future digital TV will offer an unprecedented level of programme choice. We are told that this will lead to dramatic increases in viewer satisfaction as all viewing tastes a...
130
click to vote
JCP
2008
15 years 4 months ago
2008
-In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear progr...
150
click to vote
BMCBI
2006
2006
Analysis of optimal phenotypic space using elementary modes as applied to Corynebacterium glutamicum
15 years 4 months ago
Background: Quantification of the metabolic network of an organism offers insights into possible ways of developing mutant strain for better productivity of an extracellular metab...
151
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
145
click to vote
CP
2006
Springer
15 years 8 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...