Sciweavers

510 search results - page 21 / 102
» How Should We Solve Search Problems Privately
Sort
View
SAT
2009
Springer
91views Hardware» more  SAT 2009»
14 years 2 months ago
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
Eric I. Hsu, Sheila A. McIlraith
ICCBR
2005
Springer
14 years 1 months ago
Combining Case-Based Memory with Genetic Algorithm Search for Competent Game AI
We use case-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic algorithms combine genetic algorithm search with a case-...
Sushil J. Louis, Chris Miles
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
14 years 27 days ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
CN
2007
137views more  CN 2007»
13 years 7 months ago
AID: A global anti-DoS service
Distributed denial of service (DDoS) has long been an open security problem of the Internet. Most proposed solutions require the upgrade of routers across the Internet, which is e...
Shigang Chen, Yibei Ling, Randy Chow, Ye Xia
COGSR
2011
71views more  COGSR 2011»
13 years 2 months ago
Psychological models of human and optimal performance in bandit problems
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...
Michael D. Lee, Shunan Zhang, Miles Munro, Mark St...