Sciweavers

833 search results - page 90 / 167
» Simpler and better approximation algorithms for network desi...
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
ISMIS
2005
Springer
14 years 1 months ago
Robust Inference of Bayesian Networks Using Speciated Evolution and Ensemble
Recently, there are many researchers to design Bayesian network structures using evolutionary algorithms but most of them use the only one fittest solution in the last generation. ...
Kyung-Joong Kim, Ji-Oh Yoo, Sung-Bae Cho
DAC
2005
ACM
14 years 8 months ago
A low latency router supporting adaptivity for on-chip interconnects
The increased deployment of System-on-Chip designs has drawn attention to the limitations of on-chip interconnects. As a potential solution to these limitations, Networks-on -Chip...
Jongman Kim, Dongkook Park, Theo Theocharides, Nar...
STACS
2010
Springer
14 years 2 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
IWSOS
2009
Springer
14 years 2 months ago
A Distributed Range Assignment Protocol
We present a new distributed algorithm for creating and maintaining power-efficient topologies in a wireless network. The wireless nodes establish links to neighbouring nodes in a ...
Steffen Wolf, Tom Ansay, Peter Merz