Sciweavers

1142 search results - page 11 / 229
» Set Variables and Local Search
Sort
View
ACSC
2008
IEEE
14 years 3 months ago
An investigation on a community's web search variability
Users’ past search behaviour provides a rich context that an information retrieval system can use to tailor its search results to suit an individual’s or a community’s infor...
Mingfang Wu, Andrew Turpin, Justin Zobel
GECCO
2004
Springer
148views Optimization» more  GECCO 2004»
14 years 2 months ago
Evolving Local Search Heuristics for SAT Using Genetic Programming
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
Alex S. Fukunaga
SAT
2005
Springer
95views Hardware» more  SAT 2005»
14 years 2 months ago
Random Walk with Continuously Smoothed Variable Weights
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
Steven David Prestwich
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
14 years 9 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
CADE
2004
Springer
14 years 9 months ago
Uniform variable splitting
ended abstract motivates and presents techniques for identifying variable independence in free variable calculi for classical logic without equality. Two variables are called indep...
Roger Antonsen