12597 search results - page 2361 / 2520 » Complexity of Mechanism Design |
219
Voted
MOBICOM
2003
ACM
16 years 7 days ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
211
click to vote
NETGAMES
2003
ACM
16 years 7 days ago
2003
ACM
Plenty of work was contributed in the field of protocol design and performance evaluation of multi-hop networks. It is generally accepted that mobility has a huge impact on the p...
197
Voted
SBCCI
2003
ACM
16 years 7 days ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
185
click to vote
SIGCOMM
2003
ACM
16 years 7 days 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...
215
Voted
SIGSOFT
2003
ACM
16 years 7 days ago
2003
ACM
1 Step-wise refinement (SWR) asserts that complex programs can be derived from simple programs by progressively adding features. The length of a program specification is the number...