Sciweavers

1795 search results - page 100 / 359
» Search by strategy
Sort
View
SIGIR
2011
ACM
14 years 9 months ago
Find it if you can: a game for modeling different types of web search success using interaction data
A better understanding of strategies and behavior of successful searchers is crucial for improving the experience of all searchers. However, research of search behavior has been s...
Mikhail Ageev, Qi Guo, Dmitry Lagun, Eugene Agicht...
JAMDS
2000
90views more  JAMDS 2000»
15 years 6 months ago
Stratified filtered sampling in stochastic optimization
We develop a methodology for evaluating a decision strategy generated by a stochastic optimization model. The methodology is based on a pilot study in which we estimate the distri...
Robert Rush, John M. Mulvey, John E. Mitchell, Tho...
EACL
2009
ACL Anthology
16 years 7 months ago
Translation as Weighted Deduction
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
Adam Lopez
COR
2006
98views more  COR 2006»
15 years 6 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
GLVLSI
1998
IEEE
129views VLSI» more  GLVLSI 1998»
15 years 10 months ago
Tabu Search Based Circuit Optimization
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
Sadiq M. Sait, Habib Youssef, Munir M. Zahra