Sciweavers

4698 search results - page 6 / 940
» Making Functionality More General
Sort
View
SIGIR
2010
ACM
14 years 2 months ago
Learning more powerful test statistics for click-based retrieval evaluation
Interleaving experiments are an attractive methodology for evaluating retrieval functions through implicit feedback. Designed as a blind and unbiased test for eliciting a preferen...
Yisong Yue, Yue Gao, Olivier Chapelle, Ya Zhang, T...
SIAMJO
2008
85views more  SIAMJO 2008»
13 years 10 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
ACL2
2006
ACM
14 years 4 months ago
Function memoization and unique object representation for ACL2 functions
We have developed an extension of ACL2 that includes the implementation of hash-based association lists and function memoization; this makes some algorithms execute more quickly. ...
Robert S. Boyer, Warren A. Hunt Jr.
CSFW
2005
IEEE
14 years 4 months ago
Deciding Knowledge in Security Protocols under (Many More) Equational Theories
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
Martín Abadi, Véronique Cortier
LFCS
2007
Springer
14 years 5 months ago
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier