Sciweavers

145 search results - page 26 / 29
» Parameterized Complexity Classes under Logical Reductions
Sort
View
LPNMR
2007
Springer
14 years 1 months ago
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
Stefan Woltran
DNA
2011
Springer
227views Bioinformatics» more  DNA 2011»
12 years 7 months ago
Cooperative Assembly Systems
Several molecular systems form large-scale objects. One would like to understand their assembly and how this assembly is regulated. As a first step, we investigate the phase trans...
Vincent Danos, Heinz Koeppl, John Wilson-Kanamori
CDC
2008
IEEE
14 years 1 months ago
Shannon meets Bellman: Feature based Markovian models for detection and optimization
— The goal of this paper is to develop modeling techniques for complex systems for the purposes of control, estimation, and inference: (i) A new class of Hidden Markov Models is ...
Sean P. Meyn, George Mathew
DSN
2011
IEEE
12 years 7 months ago
Approximate analysis of blocking queueing networks with temporal dependence
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
Vittoria de Nitto Persone, Giuliano Casale, Evgeni...
GEOINFORMATICA
1998
125views more  GEOINFORMATICA 1998»
13 years 7 months ago
Computational Perspectives on Map Generalization
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...
Robert Weibel, Christopher B. Jones