Sciweavers

440 search results - page 45 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
ISCAPDCS
2004
13 years 9 months ago
Heuristics-Based Replication Schemas for Fast Information Retrieval over the Internet
Internet today, has transformed into a global information hub. The increase in its usage and magnitude have sparkled various research problems. Because of the diverse user populat...
Samee Ullah Khan, Ishfaq Ahmad
JAIR
2006
179views more  JAIR 2006»
13 years 7 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
AUSAI
2003
Springer
14 years 29 days ago
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
Ying Kong, Fan Wang, Andrew Lim, Songshan Guo
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 7 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
COMPGEOM
2010
ACM
14 years 25 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park