805 search results - page 96 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
134
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Sequencing is usually per...
139
click to vote
ISNN
2005
Springer
15 years 10 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
129
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
164
click to vote
EOR
2010
14 years 11 months ago
2010
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
128
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...