2214 search results - page 139 / 443 » complexity 2004 |
NPC
2004
Springer
14 years 3 months ago
2004
Springer
In conventional DHTs, each node is assigned an exclusive slice of identifier space. Simple it is, such arrangement may be rough. In this paper we propose a generic component struc...
PRL
2006
13 years 10 months ago
2006
This paper describes an ant colony optimization approach adopted to decide on road-borders to automatically guide a vehicle developed for the DARPA Grand Challenge 2004, available...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
FSTTCS
2004
Springer
14 years 3 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
ICWE
2004
Springer
14 years 3 months ago
2004
Springer
The usability of web applications today often suffers from the page-based medium’s lack of intrinsic support for hierarchical dialog sequences mirroring the parent-child relatio...