Sciweavers

2137 search results - page 399 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
ACTA
2006
104views more  ACTA 2006»
15 years 2 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
CORR
2010
Springer
197views Education» more  CORR 2010»
15 years 15 days ago
Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents
—Autonomous wireless agents such as unmanned aerial vehicles, mobile base stations, or self-operating wireless nodes present a great potential for deployment in next-generation w...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...
JAIR
2006
179views more  JAIR 2006»
15 years 1 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
JCP
2008
116views more  JCP 2008»
15 years 1 months ago
Sensor Location Strategy in Large-Scale Systems for Fault Detection Applications
Fault detection in large-scale systems is conducted by the use of sensors, thus the sensor location influences the performances of fault detection directly. As the scale of systems...
Fan Yang, Deyun Xiao
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 7 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang