3466 search results - page 566 / 694 » Fast computation of special resultants |
163
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Given the substantial computational requirements of stochastic simulation, approximation is essential for efficient analysis of any realistic biochemical system. This pap...
160
click to vote
AIPS
2010
15 years 8 months ago
2010
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
165
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
181
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
196
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...