Sciweavers

1191 search results - page 8 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
ISER
2000
Springer
112views Robotics» more  ISER 2000»
13 years 11 months ago
Simulation and Experimental Evaluation of Complete Sensor-Based Coverage in Rectilinear Environments
: Although sensor-based coverage is a skill which is applicable to a variety of robot tasks, its implementation has so far been limited, mostly by the physical limitations of tradi...
Zack J. Butler, Alfred A. Rizzi, Ralph L. Hollis
AAAI
2004
13 years 9 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml
DMIN
2006
138views Data Mining» more  DMIN 2006»
13 years 9 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou
ICIP
2000
IEEE
14 years 9 months ago
Spatially Adaptive Image Denoising Under OverComplete Expansion
This paper presents a novel wavelet-based image denoising algorithm under overcomplete expansion. In order to optimize the denoising performance, we make a systematic study of bot...
Xin Li, Michael T. Orchard