Sciweavers

1639 search results - page 257 / 328
» Anytime Heuristic Search
Sort
View
AAAI
2000
13 years 10 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
IR
2006
13 years 8 months ago
Hierarchical clustering of a Finnish newspaper article collection with graded relevance assessments
Search facilitated with agglomerative hierarchical clustering methods was studied in a collection of Finnish newspaper articles (N = 53,893). To allow quick experiments, clustering...
Tuomo Korenius, Jorma Laurikkala, Martti Juhola, K...
JAIR
2006
157views more  JAIR 2006»
13 years 8 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 5 months ago
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
Thanasis Balafoutis, Anastasia Paparrizou, Kostas ...
WWW
2011
ACM
13 years 3 months ago
Inverted index compression via online document routing
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
Gal Lavee, Ronny Lempel, Edo Liberty, Oren Somekh