Sciweavers

914 search results - page 119 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
ASE
1998
81views more  ASE 1998»
13 years 8 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
FLOPS
2004
Springer
14 years 2 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
IWINAC
2007
Springer
14 years 3 months ago
EDNA: Estimation of Dependency Networks Algorithm
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
José A. Gámez, Juan L. Mateo, Jose M...
SSPR
2004
Springer
14 years 2 months ago
Learning People Movement Model from Multiple Cameras for Behaviour Recognition
Abstract. In surveillance systems for monitoring people behaviour, it is imporant to build systems that can adapt to the signatures of the people tasks and movements in the environ...
Nam Thanh Nguyen, Svetha Venkatesh, Geoff A. W. We...
RECOMB
2010
Springer
14 years 3 months ago
Genomic DNA k-mer Spectra: Models and Modalities
Background: The empirical frequencies of DNA k-mers in whole genome sequences provide an interesting perspective on genomic complexity, and the availability of large segments of g...
Benny Chor, David Horn, Nick Goldman, Yaron Levy, ...