Sciweavers

1964 search results - page 131 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
ICRA
2005
IEEE
149views Robotics» more  ICRA 2005»
14 years 1 months ago
A Markov Chain Monte Carlo Approach to Closing the Loop in SLAM
— The problem of simultaneous localization and mapping has received much attention over the last years. Especially large scale environments, where the robot trajectory loops back...
Michael Kaess, Frank Dellaert
IPPS
2007
IEEE
14 years 2 months ago
Network-Oblivious Algorithms
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
Gianfranco Bilardi, Andrea Pietracaprina, Geppino ...
AE
2009
Springer
13 years 9 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
AAAI
1994
13 years 9 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin
ISCI
2008
117views more  ISCI 2008»
13 years 8 months ago
Search based software testing of object-oriented containers
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...
Andrea Arcuri, Xin Yao