Sciweavers

1639 search results - page 7 / 328
» Anytime Heuristic Search
Sort
View
ACG
2003
Springer
14 years 21 days ago
Evaluation Function Tuning via Ordinal Correlation
Heuristic search effectiveness depends directly upon the quality of heuristic evaluations of states in the search space. We show why ordinal correlation is relevant to heuristic se...
Dave Gomboc, T. Anthony Marsland, Michael Buro
ATAL
2008
Springer
13 years 9 months ago
Self-interested database managers playing the view maintenance game
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a v...
Hala Mostafa, Victor R. Lesser, Gerome Miklau
ICMCS
2009
IEEE
96views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Optimizing segment caching for peer-to-peer on-demand streaming
In peer-to-peer (P2P) on-demand streaming applications, multimedia content is divided into segments and peers can seek any segments for viewing at anytime. Since different segment...
Ho-Shing Tang, Shueng-Han Gary Chan, Haochao Li
AE
2007
Springer
14 years 1 months ago
Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
Mohamed Bahy Bader-El-Den, Riccardo Poli
PRICAI
2004
Springer
14 years 25 days ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann