Sciweavers

1456 search results - page 124 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
AIPS
2008
13 years 10 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
WWW
2010
ACM
14 years 3 months ago
Sampling high-quality clicks from noisy click data
Click data captures many users’ document preferences for a query and has been shown to help significantly improve search engine ranking. However, most click data is noisy and of...
Adish Singla, Ryen W. White
CN
2007
129views more  CN 2007»
13 years 8 months ago
Machine-learnt versus analytical models of TCP throughput
We first study the accuracy of two well-known analytical models of the average throughput of long-term TCP flows, namely the so-called SQRT and PFTK models, and show that these ...
Ibtissam El Khayat, Pierre Geurts, Guy Leduc
EMNLP
2008
13 years 9 months ago
A Generative Model for Parsing Natural Language to Meaning Representations
In this paper, we present an algorithm for learning a generative model of natural language sentences together with their formal meaning representations with hierarchical structure...
Wei Lu, Hwee Tou Ng, Wee Sun Lee, Luke S. Zettlemo...
SARA
2009
Springer
14 years 2 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...