365 search results - page 29 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
105
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We present an interactive approach for segmenting thin volumetric structures. The proposed segmentation model is based on an anisotropic weighted Total Variation energy with a glo...
86
Voted
AIPS
2007
15 years 2 months ago
2007
This paper treats the problem of managing personal tasks, through an adaptation of the Squeaky Wheel Optimization (SWO) framework, enhanced with powerful heuristics and full const...
187
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
127
click to vote
AUSAI
2008
Springer
15 years 2 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
108
Voted
AI
2003
Springer
15 years 5 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...