Sciweavers

4192 search results - page 515 / 839
» Efficient testing of groups
Sort
View
IJCAI
1989
15 years 5 months ago
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
Rina Dechter, Itay Meiri
WCE
2007
15 years 5 months ago
Objective Methods for Analysing Unreplicated Factorial Designs
— There is not a method for analysing unreplicated factorial designs that performs well for various configurations of number and size of active effects. Moreover, the most popula...
Nuno Costa, Zulema Lopes Pereira
AE
2009
Springer
15 years 5 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
164
Voted
AVSS
2009
IEEE
15 years 5 months ago
Robust Vehicle Detection for Tracking in Highway Surveillance Videos Using Unsupervised Learning
This paper presents a novel approach to vehicle detection in highway surveillance videos. This method incorporates well-studied computer vision and machine learning techniques to ...
Birgi Tamersoy, Jake K. Aggarwal
ATAL
2010
Springer
15 years 5 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak