2994 search results - page 251 / 599 » Time sequences |
156
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
151
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for t...
113
click to vote
ALT
1998
Springer
15 years 8 months ago
1998
Springer
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
127
click to vote
FOCS
1994
IEEE
15 years 8 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
178
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, a novel approach for designing chromosome has been proposed to improve the effectiveness, which called multistage operation-based genetic algorithm (moGA). The obje...