Sciweavers

4679 search results - page 254 / 936
» Modeling When Connections Are the Problem
Sort
View
AAAI
2004
15 years 8 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
IJSNET
2007
95views more  IJSNET 2007»
15 years 6 months ago
On extracting consistent graphs in wireless sensor networks
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
Murtuza Jadliwala, Qi Duan, Jinhui Xu, Shambhu J. ...
CEC
2008
IEEE
15 years 6 months ago
Regulation of gene regulation - smooth binding with dynamic affinity affects evolvability
Abstract-- Understanding the evolvability of simple differentiating multicellular systems is a fundamental problem in the biology of genetic regulatory networks and in computationa...
Johannes F. Knabe, Chrystopher L. Nehaniv, Maria J...
FOCS
2008
IEEE
16 years 1 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...
GLOBECOM
2006
IEEE
16 years 18 days ago
Topology Control for Constant Rate Mobile Networks
Abstract— Controlling the topology of a wireless ad hoc network is very important from the point of view of performance. One known technique for controlling the topology is throu...
Liang Zhao, Errol L. Lloyd, S. S. Ravi