Sciweavers

937 search results - page 32 / 188
» On the Complexity of Partial Order Properties
Sort
View
EJC
2010
14 years 10 months ago
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
Each clone C on a fixed base set A determines a quasiorder on the set of all operations on A by the following rule: f is a C-minor of g if f can be obtained by substituting operati...
Erkko Lehtonen, Jaroslav Nesetril
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
BMCBI
2010
178views more  BMCBI 2010»
14 years 10 months ago
Applications of a formal approach to decipher discrete genetic networks
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
Fabien Corblin, Eric Fanchon, Laurent Trilling
DATE
2006
IEEE
149views Hardware» more  DATE 2006»
15 years 4 months ago
Communication architecture optimization: making the shortest path shorter in regular networks-on-chip
Network-on-Chip (NoC)-based communication represents a promising solution to complex on-chip communication problems. Due to their regular structure, mesh-like NoC architectures ha...
Ümit Y. Ogras, Radu Marculescu, Hyung Gyu Lee...
FSTTCS
2006
Springer
15 years 1 months ago
On Reduction Criteria for Probabilistic Reward Models
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
Marcus Größer, Gethin Norman, Christel ...