10988 search results - page 2030 / 2198 » Algorithmic Folding Complexity |
154
Voted
DIALM
2003
ACM
15 years 8 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
122
Voted
SIGCOMM
2003
ACM
15 years 8 months ago
2003
ACM
We propose a new objective for network research: to build a fundamentally different sort of network that can assemble itself given high level instructions, reassemble itself as re...
149
Voted
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
147
click to vote
WSNA
2003
ACM
15 years 8 months ago
2003
ACM
This paper presents lightweight tree-based synchronization (LTS) methods for sensor networks. First, a single-hop, pair-wise synchronization scheme is analyzed. This scheme requir...
124
Voted
CIAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...