Sciweavers

1033 search results - page 74 / 207
» The Relative History Heuristic
Sort
View
ATAL
2008
Springer
15 years 1 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 1 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
ICRA
2009
IEEE
83views Robotics» more  ICRA 2009»
15 years 6 months ago
Real-time correlative scan matching
— Scan matching, the problem of registering two laser scans in order to determine the relative positions from which the scans were obtained, is one of the most heavily relied-upo...
Edwin B. Olson
IEEEPACT
2007
IEEE
15 years 6 months ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
IPPS
2007
IEEE
15 years 6 months ago
Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment
Heterogeneous distributed computing systems often must operate in an environment where system parameters are subject to uncertainty. Robustness can be defined as the degree to wh...
Jay Smith, Luis Diego Briceno, Anthony A. Maciejew...