35 search results - page 7 / 7 » Size-Time Complexity of Boolean Networks for Prefix Computat... |
BMCBI
2008
13 years 7 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
CODES
2003
IEEE
14 years 28 days ago
2003
IEEE
Boolean logic minimization is traditionally used in logic synthesis tools running on powerful desktop computers. However, logic minimization has recently been proposed for dynamic...
GECCO
2009
Springer
14 years 7 days ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
ASYNC
2000
IEEE
14 years 1 days ago
2000
IEEE
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...