Sciweavers

14548 search results - page 425 / 2910
» The Optimal Path-Matching Problem
Sort
View
ALGOSENSORS
2010
Springer
15 years 6 months ago
Lifetime Maximization of Monitoring Sensor Networks
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
Peter Sanders, Dennis Schieferdecker
SAB
2010
Springer
189views Optimization» more  SAB 2010»
15 years 5 months ago
TeXDYNA: Hierarchical Reinforcement Learning in Factored MDPs
Reinforcement learning is one of the main adaptive mechanisms that is both well documented in animal behaviour and giving rise to computational studies in animats and robots. In th...
Olga Kozlova, Olivier Sigaud, Christophe Meyer
GECCO
2009
Springer
164views Optimization» more  GECCO 2009»
15 years 5 months ago
Solving iterated functions using genetic programming
An iterated function f(x) is a function that when composed with itself, produces a given expression f(f(x))=g(x). Iterated functions are essential constructs in fractal theory and...
Michael D. Schmidt, Hod Lipson
COMPLEXITY
2010
120views more  COMPLEXITY 2010»
15 years 5 months ago
The complexity of partition tasks
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
Fernando Eesponda, Matías Vera-Cruz, Jorge ...
TCOM
2011
83views more  TCOM 2011»
15 years 2 months ago
Minimizing Sum-MSE Implies Identical Downlink and Dual Uplink Power Allocations
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
Adam J. Tenenbaum, Raviraj S. Adve