Sciweavers

3333 search results - page 203 / 667
» Abstract Proof Search
Sort
View
ECML
2006
Springer
15 years 8 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
IJCAI
2007
15 years 5 months ago
Nogood Recording from Restarts
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
16 years 5 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
EVOW
2009
Springer
15 years 11 months ago
A Tabu Search Algorithm with Direct Representation for Strip Packing
Abstract. This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of...
Jean-Philippe Hamiez, Julien Robet, Jin-Kao Hao
DEXAW
2009
IEEE
139views Database» more  DEXAW 2009»
15 years 11 months ago
Improving Web Page Retrieval Using Search Context from Clicked Domain Names
Abstract—Search context is a crucial factor that helps to understand a user’s information need in ad-hoc Web page retrieval. A query log of a search engine contains rich inform...
Rongmei Li