2152 search results - page 291 / 431 » A Comparative Study of 2QBF Algorithms |
212
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
268
click to vote
RECOMB
2011
Springer
14 years 7 months ago
2011
Springer
Motivation. Current approaches to RNA structure prediction range from physics-based methods, which rely on thousands of experimentally-measured thermodynamic parameters, to machin...
184
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
148
click to vote
EUROCAST
2007
Springer
15 years 9 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
153
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...