Sciweavers

867 search results - page 63 / 174
» The Generalized Maximum Coverage Problem
Sort
View
AAAI
2008
13 years 10 months ago
Efficient Optimization of Information-Theoretic Exploration in SLAM
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
Thomas Kollar, Nicholas Roy
WG
2001
Springer
14 years 15 days ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...
MOBICOM
2010
ACM
13 years 8 months ago
CTRL: a self-organizing femtocell management architecture for co-channel deployment
Femtocell technology has been drawing considerable attention as a cost-effective means of improving cellular coverage and capacity. However, under co-channel deployment, femtocell...
Ji-Hoon Yun, Kang G. Shin
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
14 years 5 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
ISCI
2008
181views more  ISCI 2008»
13 years 8 months ago
Attribute reduction in decision-theoretic rough set models
Rough set theory can be applied to rule induction. There are two different types of classification rules, positive and boundary rules, leading to different decisions and consequen...
Yiyu Yao, Yan Zhao