1968 search results - page 129 / 394 » The Complexity of Valued Constraint Models |
121
click to vote
CORR
2010
Springer
15 years 5 days ago
2010
Springer
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
101
click to vote
SC
2004
ACM
15 years 7 months ago
2004
ACM
There exist many application classes for which the users have significant flexibility in the quality of output they desire. At the same time, there are other constraints, such a...
118
click to vote
COLING
2010
14 years 8 months ago
2010
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
107
click to vote
GPCE
2008
Springer
15 years 2 months ago
2008
Springer
A user interface, such as a dialog, assists a user in synthesising a set of values, typically parameters for a command object. Code for “command parameter synthesis” is usuall...
CRYPTO
2001
Springer
15 years 6 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...