1469 search results - page 221 / 294 » Approximate polynomial decomposition |
246
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
165
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
133
Voted
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
172
click to vote
INFOCOM
2009
IEEE
16 years 27 days ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
150
click to vote
COCOA
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...