5165 search results - page 170 / 1033 » Consistency of the Neighbor-Net Algorithm |
163
click to vote
SYNASC
2005
IEEE
15 years 11 months ago
2005
IEEE
Particle Swarm Optimization (PSO) technique proved its ability to deal with very complicated optimization and search problems. This paper proposes a new particle swarm variant whi...
193
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
185
click to vote
SAC
2004
ACM
15 years 11 months ago
2004
ACM
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
172
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
193
Voted
DSN
2003
IEEE
15 years 11 months ago
2003
IEEE
Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because...