603 search results - page 59 / 121 » A General Approximation Technique for Constrained Forest Pro... |
109
Voted
TPDS
2008
15 years 1 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
112
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
131
click to vote
DOCENG
2009
ACM
15 years 5 months ago
2009
ACM
We review the literature on automatic document formatting with an emphasis on recent work in the field. One common way to frame document formatting is as a constrained optimizatio...
107
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
132
Voted
UAI
2008
15 years 3 months ago
2008
Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinfor...