Sciweavers

438 search results - page 40 / 88
» New Search Heuristics for Max-CSP
Sort
View
AE
2005
Springer
15 years 3 months ago
Memetic Algorithms for the MinLA Problem
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
AAAI
2008
15 years 1 days ago
Planning with Problems Requiring Temporal Coordination
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
IDA
2008
Springer
14 years 9 months ago
A comprehensive analysis of hyper-heuristics
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
Ender Özcan, Burak Bilgin, Emin Erkan Korkmaz
SIGIR
2000
ACM
15 years 2 months ago
Hill climbing algorithms for content-based retrieval of similar configurations
The retrieval of stored images matching an input configuration is an important form of content-based retrieval. Exhaustive processing (i.e., retrieval of the best solutions) of co...
Dimitris Papadias
AI
1998
Springer
15 years 1 months ago
A Hybrid Convergent Method for Learning Probabilistic Networks
During past few years, a variety of methods have been developed for learning probabilistic networks from data, among which the heuristic single link forward or backward searches ar...
Jun Liu, Kuo-Chu Chang, Jing Zhou