Sciweavers

227 search results - page 15 / 46
» An investigation of hyper-heuristic search spaces
Sort
View
AAAI
2008
14 years 4 days ago
Measuring the Hardness of SAT Instances
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
JMLR
2008
124views more  JMLR 2008»
13 years 9 months ago
Learning Control Knowledge for Forward Search Planning
A number of today's state-of-the-art planners are based on forward state-space search. The impressive performance can be attributed to progress in computing domain independen...
Sung Wook Yoon, Alan Fern, Robert Givan
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 7 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002
WWW
2006
ACM
14 years 10 months ago
Optimizing scoring functions and indexes for proximity search in type-annotated corpora
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
Soumen Chakrabarti, Kriti Puniyani, Sujatha Das
EOR
2007
158views more  EOR 2007»
13 years 9 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...