4860 search results - page 393 / 972 » SNPs Problems, Complexity, and Algorithms |
132
Voted
CIE
2008
Springer
15 years 5 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
143
Voted
JAIR
2002
15 years 3 months ago
2002
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
109
Voted
SIGACT
2010
15 years 2 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
123
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
132
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. Different approaches to infer the dependencies of gene r...