Sciweavers

109 search results - page 5 / 22
» Fast Prefix Search in Little Space, with Applications
Sort
View
CEC
2007
IEEE
14 years 2 months ago
Solving multimodal problems via multiobjective techniques with Application to phase equilibrium detection
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...
Mike Preuss, Günter Rudolph, Feelly Tumakaka
BIOINFORMATICS
2011
13 years 4 days ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
14 years 2 months ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr
WWW
2004
ACM
14 years 9 months ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
FPL
2009
Springer
145views Hardware» more  FPL 2009»
14 years 1 months ago
Run-time Partial Reconfiguration speed investigation and architectural design space exploration
Run-time Partial Reconfiguration (PR) speed is significant in applications especially when fast IP core switching is required. In this paper, we propose to use Direct Memory Acce...
Ming Liu, Wolfgang Kuehn, Zhonghai Lu, Axel Jantsc...