654 search results - page 72 / 131 » On the Approximation of Computing Evolutionary Trees |
162
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
156
click to vote
QEST
2008
IEEE
16 years 12 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
146
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
157
click to vote
IJAR
2010
15 years 3 months ago
2010
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
170
click to vote
PPSN
1994
Springer
15 years 10 months ago
1994
Springer
This paper studies Genetic Programming (GP) and its relation to the Genetic Algorithm (GA). GP uses a GA approach to breed successive populations of programs, represented in the ch...