Sciweavers

242 search results - page 13 / 49
» On the Non-sequential Nature of Domain Models of Real-number...
Sort
View
AAAI
2010
13 years 6 months ago
Latent Class Models for Algorithm Portfolio Methods
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
Bryan Silverthorn, Risto Miikkulainen
TCS
2010
13 years 6 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
ATAL
2009
Springer
14 years 3 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
NIPS
1998
13 years 9 months ago
Learning from Dyadic Data
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
Thomas Hofmann, Jan Puzicha, Michael I. Jordan
ACL
2012
11 years 10 months ago
Semantic Parsing with Bayesian Tree Transducers
Many semantic parsing models use tree transformations to map between natural language and meaning representation. However, while tree transformations are central to several state-...
Bevan K. Jones, Mark Johnson, Sharon Goldwater