119 search results - page 20 / 24 » A relaxed approach to combinatorial problems in robustness a... |
ALGORITHMICA
2002
13 years 8 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
CVPR
2003
IEEE
14 years 2 months ago
2003
IEEE
A “graphics for vision” approach is proposed to address the problem of reconstruction from a large and imperfect data set: reconstruction on demand by tensor voting, or ROD-TV...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
ICCV
2005
IEEE
14 years 10 months ago
2005
IEEE
This paper breaks with the common practice of using a joint state space representation and performing the joint data association in multi-object tracking. Instead, we present an i...
GECCO
2007
Springer
14 years 21 days ago
2007
Springer
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...