2725 search results - page 325 / 545 » Constraint Solving for Interpolation |
165
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
157
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
185
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
166
Voted
ICCSA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. A company needs to implement several make-to-stock policies apart from a regular make-to-order production, so that the capacity of expensive resources can be fully utiliz...
148
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...