Sciweavers

1379 search results - page 269 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
FSTTCS
2008
Springer
14 years 11 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
AI
2008
Springer
14 years 10 months ago
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
Chitta Baral, Thomas Eiter, Marcus Bjäreland,...
BMCBI
2010
233views more  BMCBI 2010»
14 years 10 months ago
Odefy -- From discrete to continuous models
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...
Jan Krumsiek, Sebastian Pölsterl, Dominik M. ...
BMCBI
2006
99views more  BMCBI 2006»
14 years 10 months ago
A proposed metric for assessing the measurement quality of individual microarrays
Background: High-density microarray technology is increasingly applied to study gene expression levels on a large scale. Microarray experiments rely on several critical steps that...
Kyoungmi Kim, Grier P. Page, T. Mark Beasley, Step...
BMCBI
2006
121views more  BMCBI 2006»
14 years 10 months ago
Splice site identification using probabilistic parameters and SVM classification
Background: Recent advances and automation in DNA sequencing technology has created a vast amount of DNA sequence data. This increasing growth of sequence data demands better and ...
A. K. M. A. Baten, Bill C. H. Chang, Saman K. Halg...