1193 search results - page 200 / 239 » A primer of simple theories |
184
click to vote
SAGT
2010
Springer
15 years 4 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
182
click to vote
JCC
2011
15 years 1 months ago
2011
Abstract: With today’s available computer power, free energy calculations from equilibrium molecular dynamics simulations “via counting” become feasible for an increasing num...
256
click to vote
PLPV
2011
ACM
14 years 9 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
332
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
181
click to vote
EMSOFT
2011
Springer
14 years 5 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...