365 search results - page 31 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
106
click to vote
AI
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
135
click to vote
MP
2002
15 years 2 days ago
2002
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
81
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...