Sciweavers

614 search results - page 68 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
15 years 5 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...
ATAL
2009
Springer
16 years 22 days ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...
IPSN
2005
Springer
15 years 11 months ago
Sensing capacity for discrete sensor network applications
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
Yaron Rachlin, Rohit Negi, Pradeep K. Khosla
CIMCA
2008
IEEE
16 years 18 days ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
LATA
2010
Springer
15 years 11 months ago
Simplifying Regular Expressions. A Quantitative Perspective
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...
Hermann Gruber and Stefan Gulan