10608 search results - page 27 / 2122 » Complexity of O'Hara's Algorithm |
SWAT
2004
Springer
14 years 3 months ago
2004
Springer
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
ACID
2006
13 years 11 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
ICDT
2009
ACM
14 years 4 months ago
2009
ACM
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
IEAAIE
2004
Springer
14 years 3 months ago
2004
Springer
We present a new algorithm that provides an efficient localization method of elliptic industrial objects. Our proposed feature extraction inherits edge grouping approaches. But ins...