7106 search results - page 927 / 1422 » Restricted Complexity, General Complexity |
171
click to vote
MOBIHOC
2004
ACM
16 years 6 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
192
click to vote
MOBIHOC
2004
ACM
16 years 6 months ago
2004
ACM
Smart antennas represent a broad variety of antennas that differ in their performance and transceiver complexity. The superior capabilities of smart antennas, however, can be leve...
151
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
181
click to vote
WSDM
2010
ACM
16 years 4 months ago
2010
ACM
In addition to the actual content Web pages consist of navigational elements, templates, and advertisements. This boilerplate text typically is not related to the main content, ma...
147
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...