836 search results - page 69 / 168 » On the Complexity of Train Assignment Problems |
126
Voted
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We address the problem of multi-person dataassociation-based tracking (DAT) in semi-crowded environments from a single camera. Existing trackletassociation-based methods using pur...
123
click to vote
KBS
2007
15 years 3 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
124
Voted
EVOW
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we study a complex real world workforce scheduling problem. We apply constructive search and variable neighbourhood search (VNS) metaheuristics and enhance these meth...
145
click to vote
OOPSLA
2009
Springer
15 years 10 months ago
2009
Springer
Iterations are time-boxed periods with an intended outcome that is often a set of implemented requirements. Iterations are part of most common software development lifecycle model...
115
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
We consider the important challenge of recognizing a variety of deformable object classes in images. Of fundamental importance and particular difficulty in this setting is the pro...