Sciweavers

22 search results - page 4 / 5
» Folding Variant Narrowing and Optimal Variant Termination
Sort
View
IPL
2010
114views more  IPL 2010»
13 years 6 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
BMCBI
2008
142views more  BMCBI 2008»
13 years 7 months ago
Strategies for measuring evolutionary conservation of RNA secondary structures
Background: Evolutionary conservation of RNA secondary structure is a typical feature of many functional non-coding RNAs. Since almost all of the available methods used for predic...
Andreas R. Gruber, Stephan H. F. Bernhart, Ivo L. ...
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 9 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
CPAIOR
2008
Springer
13 years 9 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
ICRA
2008
IEEE
127views Robotics» more  ICRA 2008»
14 years 2 months ago
New framework for Simultaneous Localization and Mapping: Multi map SLAM
—The main contribution of this paper arises from the development of a new framework, which has its inspiration in the mechanics of human navigation, for solving the problem of Si...
Damith Chandana Herath, Sarath Kodagoda, Gamini Di...