35 search results - page 1 / 7 » Size-Time Complexity of Boolean Networks for Prefix Computat... |
STOC
1987
ACM
13 years 9 months ago
1987
ACM
AINA
2009
IEEE
14 years 7 days ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
ECCC
2006
13 years 5 months ago
2006
TSP
2010
13 years 3 days ago
2010
Developing computational models paves the way to understanding, predicting, and influencing the long-term behavior of genomic regulatory systems. However, several major challenges ...
SCFBM
2008
13 years 4 months ago
2008
Modern life sciences research increasingly relies on computational solutions, from large scale data analyses to theoretical modeling. Within the theoretical models Boolean network...