16093 search results - page 146 / 3219 » On the optimality of the neighbor-joining algorithm |
133
click to vote
ECML
2003
Springer
15 years 7 months ago
2003
Springer
Comparative machine learning experiments have become an important methodology in empirical approaches to natural language processing (i) to investigate which machine learning algor...
123
click to vote
ISAAC
1997
Springer
15 years 5 months ago
1997
Springer
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...
114
click to vote
AINA
2004
IEEE
15 years 5 months ago
2004
IEEE
The routing algorithms for multimedia communication should use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting sys...
ESCIENCE
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations ...
113
click to vote
ICALP
2000
Springer
15 years 5 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...