2398 search results - page 233 / 480 » Constraint Programming and Graph Algorithms |
178
click to vote
IJCAI
2003
15 years 7 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
159
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
We consider a real-world problem arising in a warehouse for spare parts. Items ordered by customers shall be collected and for this purpose our task is to determine efficient picku...
194
click to vote
GLOBECOM
2007
IEEE
16 years 26 days ago
2007
IEEE
—Recharging the batteries of a moribund sensor deployed as part of a wireless sensor network is often infeasible due to logistical considerations. With the purpose of prolonging ...
183
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
202
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...