Sciweavers

1259 search results - page 229 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
SIGCOMM
2010
ACM
13 years 7 months ago
Achieving O(1) IP lookup on GPU-based software routers
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
Jin Zhao, Xinya Zhang, Xin Wang, Xiangyang Xue
BMCBI
2010
136views more  BMCBI 2010»
13 years 7 months ago
The IronChip evaluation package: a package of perl modules for robust analysis of custom microarrays
Background: Gene expression studies greatly contribute to our understanding of complex relationships in gene regulatory networks. However, the complexity of array design, producti...
Yevhen Vainshtein, Mayka Sanchez, Alvis Brazma, Ma...
ICALP
1993
Springer
13 years 11 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
DAC
2002
ACM
14 years 8 months ago
Schedulability of event-driven code blocks in real-time embedded systems
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Tasks in many such systems, like netwo...
Samarjit Chakraborty, Thomas Erlebach, Simon K&uum...
ICANNGA
2009
Springer
212views Algorithms» more  ICANNGA 2009»
14 years 2 months ago
Evolutionary Regression Modeling with Active Learning: An Application to Rainfall Runoff Modeling
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
Ivo Couckuyt, Dirk Gorissen, Hamed Rouhani, Eric L...