10608 search results - page 346 / 2122 » Complexity of O'Hara's Algorithm |
92
Voted
ALGORITHMICA
2008
15 years 27 days ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
CORR
2007
Springer
15 years 22 days ago
2007
Springer
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
84
Voted
TSP
2008
15 years 19 days ago
2008
Timing synchronization is a critical challenge in ultra-wideband impulse radios (UWB-IRs). Conventional fulldigital synchronization methods encounter implementation difficulties su...
100
click to vote
GIS
2010
ACM
14 years 11 months ago
2010
ACM
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under ...
118
Voted
GECCO
2009
Springer
14 years 10 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...