4759 search results - page 519 / 952 » Parallelizing the Phylogeny Problem |
175
Voted
SODA
1990
ACM
15 years 8 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
170
click to vote
NN
2000
Springer
15 years 6 months ago
2000
Springer
Linear projection equations arise in many optimization problems and have important applications in science and engineering. In this paper, we present a recurrent neural network fo...
189
click to vote
JMLR
2010
15 years 5 months ago
2010
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
164
click to vote
IJACTAICIT
2010
15 years 4 months ago
2010
In this article, a hybrid optimization method has been proposed consisting of modified ant colony systems (ACSs) and constrained nonlinear programming (NLP) to solve the problems ...
240
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...