Sciweavers

1144 search results - page 129 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
COR
2010
146views more  COR 2010»
14 years 10 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
TPDS
2002
80views more  TPDS 2002»
14 years 9 months ago
Performance Optimization Problem in Speculative Prefetching
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
14 years 8 months ago
Multiple relative pose graphs for robust cooperative mapping
Abstract— This paper describes a new algorithm for cooperative and persistent simultaneous localization and mapping (SLAM) using multiple robots. Recent pose graph representation...
Been Kim, Michael Kaess, Luke Fletcher, John J. Le...
ECCV
2006
Springer
15 years 12 months ago
Optimal Multi-frame Correspondence with Assignment Tensors
Abstract. Establishing correspondence between features of a set of images has been a long-standing issue amongst the computer vision community. We propose a method that solves the ...
R. Oliveira, R. Ferreira, J. P. Costeira
HPDC
2005
IEEE
15 years 3 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant