1013 search results - page 167 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
117
click to vote
WEA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
JACM
2006
14 years 9 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
CIAC
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
103
click to vote
ROBOCUP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Two main challenges of robot action planning in real domains are uncertain action effects and dynamic environments. In this paper, an instance-based action model is lear...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— This paper presents a new approach to the multirobot map-alignment problem that enables teams of robots to build joint maps without initial knowledge of their relative ...