3229 search results - page 421 / 646 » The Theory of Timed Automata |
193
click to vote
COLT
2005
Springer
15 years 8 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
197
Voted
CADE
2004
Springer
16 years 7 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
170
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper formulates and studies a general continuous-time behavioral portfolio selection model under Kahneman and Tversky's (cumulative) prospect theory, featuring S-shaped...
232
click to vote
CSL
2007
Springer
16 years 27 days ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
162
click to vote
PPDP
2007
Springer
16 years 25 days ago
2007
Springer
Orc is a language proposed by Jayadev Misra [19] for orchestration of distributed services. Orc is very simple and elegant, based on a few basic constructs, and allows succinct an...