Sciweavers

1331 search results - page 151 / 267
» Complexity bounds for zero-test algorithms
Sort
View
ALGORITHMICA
2011
14 years 1 months ago
Algorithms for Marketing-Mix Optimization
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid
AMAI
2008
Springer
14 years 10 months ago
Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
Patrick Amstutz, Nikolaus Correll, Alcherio Martin...
FSTTCS
2009
Springer
15 years 4 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
SIAMSC
2011
85views more  SIAMSC 2011»
14 years 25 days ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
MOBIHOC
2008
ACM
15 years 9 months ago
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Recent research shows that significant energy saving can be achieved in wireless sensor networks with a mobile base station that collects data from sensor nodes via short-range co...
Guoliang Xing, Tian Wang, Weijia Jia, Minming Li