1802 search results - page 182 / 361 » Complexity Theory for Operators in Analysis |
152
click to vote
GECCO
2005
Springer
16 years 54 min ago
2005
Springer
We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems ...
164
click to vote
DIALM
2004
ACM
15 years 12 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
179
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
147
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
187
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...