2137 search results - page 404 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
149
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
157
click to vote
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
156
click to vote
PKDD
2005
Springer
15 years 10 months ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
155
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
161
click to vote
EC
1998
15 years 4 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...