18306 search results - page 3092 / 3662 » Algorithmics in Exponential Time |
145
Voted
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
132
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...
149
click to vote
CPM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
123
click to vote
DCOSS
2007
Springer
15 years 11 months ago
2007
Springer
Localization is a fundamental problem in wireless sensor networks. In this paper, we consider how to localize individual nodes in a wireless sensor network when some subset of the...
158
click to vote
DCOSS
2007
Springer
15 years 11 months ago
2007
Springer
With the field of wireless sensor networks rapidly maturing, the focus shifts from “easy” deployments, like remote monitoring, to more difficult domains where applications imp...