Sciweavers

657 search results - page 126 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
93
Voted
IPPS
2007
IEEE
15 years 6 months ago
Aggregate Threshold Queries in Sensor Networks
— An important class of queries over sensor networks are network-wide aggregation queries. In this work we study a class of aggregation queries which we refer to as aggregate thr...
Izchak Sharfman, Assaf Schuster, Daniel Keren
CCR
2008
88views more  CCR 2008»
14 years 11 months ago
My ten favorite "practical theory" papers
As the saying goes, "In theory there is no difference between theory and practice. But, in practice, there is." Networking research has a wealth of good papers on both s...
Jennifer Rexford
JAIR
2008
171views more  JAIR 2008»
14 years 11 months ago
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...
Robert Mateescu, Rina Dechter, Radu Marinescu 0002
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 24 days ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
106
Voted
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 5 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan