11016 search results - page 2058 / 2204 » Cloud Computing for Science |
166
Voted
ICST
2009
IEEE
15 years 11 months ago
2009
IEEE
It is challenging to test applications and functions for which the correct output for arbitrary input cannot be known in advance, e.g. some computational science or machine learni...
124
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
164
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
110
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
133
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...