86 search results - page 6 / 18 » A Classical Realizability Model for a Semantical Value Restr... |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
SEMWEB
2005
Springer
15 years 3 months ago
2005
Springer
This paper addresses a major weakness of current technologies for the Semantic Web, namely the lack of a principled means to represent and reason about uncertainty. This not only h...
179
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
131
click to vote
JIT
2005
Springer
15 years 3 months ago
2005
Springer
Automatic Grid resource discovery and brokerage shields the Grid middleware complexities from the Grid users and leads towards an invisible but simple and robust Grid. Realizing th...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In many vision problems, instead of having fully annotated training data, it is easier to obtain just a subset of data with annotations, because it is less restrictive for the use...