1158 search results - page 18 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
SSDBM
2002
IEEE
15 years 2 months ago
2002
IEEE
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
NIPS
2007
14 years 11 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )