Sciweavers

1887 search results - page 195 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
FSTTCS
2000
Springer
14 years 28 days ago
Text Sparsification via Local Maxima
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Gr...
AAAI
2006
13 years 10 months ago
Incremental Least Squares Policy Iteration for POMDPs
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
Hui Li, Xuejun Liao, Lawrence Carin
PDCN
2004
13 years 10 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 9 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
DASFAA
2007
IEEE
134views Database» more  DASFAA 2007»
14 years 3 months ago
Eliciting Matters - Controlling Skyline Sizes by Incremental Integration of User Preferences
Today, result sets of skyline queries are unmanageable due to their exponential growth with the number of query predicates. In this paper we discuss the incremental re-computation ...
Wolf-Tilo Balke, Ulrich Güntzer, Christoph Lo...