Sciweavers

69 search results - page 10 / 14
» Generic Incremental Algorithms for Local Search
Sort
View
DAWAK
1999
Springer
14 years 24 days ago
Dynamic Data Warehouse Design
A data warehouse DW can be seen as a set of materialized views de ned over remote base relations. When a query is posed, it is evaluated locally, using the materialized views, wi...
Dimitri Theodoratos, Timos K. Sellis
MM
2006
ACM
155views Multimedia» more  MM 2006»
14 years 2 months ago
Robust voting algorithm based on labels of behavior for video copy detection
This paper presents an efficient approach for copies detection in a large videos archive consisting of several hundred of hours. The video content indexing method consists of ext...
Julien Law-To, Olivier Buisson, Valérie Gou...
ICRA
2002
IEEE
121views Robotics» more  ICRA 2002»
14 years 1 months ago
An Efficient Approach to the Simultaneous Localisation and Mapping Problem
—The simultaneous localization and map building (SLAM) problem asks if it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and then...
Stefan B. Williams, Gamini Dissanayake, Hugh F. Du...
SLS
2007
Springer
103views Algorithms» more  SLS 2007»
14 years 2 months ago
Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through
Stochastic Local Search (SLS) is quite effective for a variety of Combinatorial (Optimization) Problems (COP). However, the performance of SLS depends on several factors and getti...
Steven Halim, Roland H. C. Yap
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 3 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke