4940 search results - page 219 / 988 » On the Complexity of Universal Programs |
151
click to vote
LPNMR
2005
Springer
15 years 12 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
182
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The synthesis of stochastic processes using genetic programming is investigated. Stochastic process behaviours take the form of time series data, in which quantities of interest v...
166
click to vote
SIMUTOOLS
2008
15 years 8 months ago
2008
Model checking is a suitable formal technique to analyze parallel programs' execution in an industrial context because automated tools can be designed and operated with very ...
173
click to vote
CODES
2011
IEEE
14 years 6 months ago
2011
IEEE
Two overriding concerns in the development of embedded MPSoCs are ease of programming and hardware complexity. In this paper we present SoC-TM, an integrated HW/SW solution for tr...
180
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...