5326 search results - page 205 / 1066 » On what we can ensure |
157
click to vote
MOR
2010
15 years 5 months ago
2010
We develop first-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of ...
150
click to vote
SYNTHESE
2010
15 years 4 months ago
2010
In the Newcomb problem, the standard arguments for taking either one box or both boxes adduce what seem to be relevant considerations, but they are not complete arguments, and att...
182
click to vote
COLING
2010
15 years 1 months ago
2010
Martins et al. (2008) presented what to the best of our knowledge still ranks as the best overall result on the CONLLX Shared Task datasets. The paper shows how triads of stacked ...
270
click to vote
CALCO
2011
Springer
14 years 6 months ago
2011
Springer
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
188
click to vote
AB
2007
Springer
16 years 21 days ago
2007
Springer
What is systems biology? What can biologists gain from an attempt to algebraize the questions in systems biology? Starting with plausible biological theses, can one algebraically m...