Sciweavers

329 search results - page 14 / 66
» On Range Searching with Semialgebraic Sets
Sort
View
VL
2006
IEEE
14 years 2 months ago
Sketching with Conceptual Metaphors to Explain Computational Processes
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...
David G. Hendry
CP
1997
Springer
14 years 22 days ago
Programming Constraint Inference Engines
Abstract. Existing constraint programming systems offer a fixed set of inference engines implementing search strategies such as single, all, and best solution search. This is unfo...
Christian Schulte
IJCAI
2007
13 years 10 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...
CORR
2006
Springer
126views Education» more  CORR 2006»
13 years 8 months ago
Evaluating the Robustness of Learning from Implicit Feedback
This paper evaluates the robustness of learning from implicit feedback in web search. In particular, we create a model of user behavior by drawing upon user studies in laboratory ...
Filip Radlinski, Thorsten Joachims
EVOW
2008
Springer
13 years 10 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...