Sciweavers

307 search results - page 58 / 62
» On Equations over Sets of Integers
Sort
View
AI
2011
Springer
13 years 2 months ago
Expressive markets for donating to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
Vincent Conitzer, Tuomas Sandholm
WICOMM
2011
13 years 2 months ago
A pragmatic approach to area coverage in hybrid wireless sensor networks
Success of Wireless Sensor Networks (WSN) largely depends on whether the deployed network can provide desired area coverage with acceptable network lifetime. This paper seeks to a...
Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 10 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
FOCS
2009
IEEE
14 years 2 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
LSSC
2007
Springer
14 years 1 months ago
Bridging Methods for Coupling Atomistic and Continuum Models
Abstract. We review some recent developments in the coupling of atomistic and continuum models based on the blending of the two models in a bridge region connecting the other two r...
Santiago Badia, Pavel B. Bochev, Max Gunzburger, R...