DIALM
2008
ACM
13 years 11 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
DIALM
2008
ACM
13 years 11 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
DCOSS
2008
Springer
13 years 11 months ago
2008
Springer
Sensor networks can be viewed as large distributed databases, and SQL-like high-level declarative languages can be used for data and information retrieval. Energy constraints make ...
FUN
2007
Springer
13 years 11 months ago
2007
Springer
This paper is devoted to the “Discovery of Slowness.” The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with ele...
CONEXT
2008
ACM
13 years 11 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
COMPGEOM
2008
ACM
13 years 11 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
COMPGEOM
2008
ACM
13 years 11 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
COLT
2008
Springer
13 years 11 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
COCO
2008
Springer
13 years 11 months ago
2008
Springer
r of Unentanglement (Extended Abstract) Scott Aaronson MIT Salman Beigi MIT Andrew Drucker MIT Bill Fefferman University of Chicago Peter Shor MIT The class QMA (k), introduced by...
COCO
2008
Springer
13 years 11 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...