6365 search results - page 203 / 1273 » Fast Local Computation Algorithms |
179
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting m...
154
click to vote
CEC
2007
IEEE
16 years 20 days ago
2007
IEEE
Abstract— For solving multimodal problems by means of evolutionary algorithms, one often resorts to multistarts or niching methods. The latter approach the question: ‘What is e...
142
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
174
click to vote
ICSM
2007
IEEE
16 years 18 days ago
2007
IEEE
Bioinformaticists use the Basic Local Alignment Search Tool (BLAST) to characterize an unknown sequence by comparing it against a database of known sequences, thus detecting evolu...
197
click to vote
CLUSTER
2005
IEEE
15 years 12 months ago
2005
IEEE
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...