Sciweavers

2260 search results - page 333 / 452
» A new algorithm for clustering search results
Sort
View
CIKM
2005
Springer
15 years 8 months ago
Using RankBoost to compare retrieval systems
This paper presents a new pooling method for constructing the assessment sets used in the evaluation of retrieval systems. Our proposal is based on RankBoost, a machine learning v...
Huyen-Trang Vu, Patrick Gallinari
AIPS
2006
15 years 7 months ago
Fast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
PPSN
2010
Springer
15 years 4 months ago
Globally Induced Model Trees: An Evolutionary Approach
In the paper we propose a new evolutionary algorithm for induction of univariate regression trees that associate leaves with simple linear regression models. In contrast to typical...
Marcin Czajkowski, Marek Kretowski
ECML
2001
Springer
15 years 11 months ago
A Framework for Learning Rules from Multiple Instance Data
Abstract. This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. In a multiple-instance representation, each learning example is r...
Yann Chevaleyre, Jean-Daniel Zucker
TJS
2002
160views more  TJS 2002»
15 years 6 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon