7522 search results - page 1159 / 1505 » Spacing memetic algorithms |
131
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
Dividing web pages into fragments has been shown to provide significant benefits for both content generation and caching. In order for a web site to use fragment-based content gen...
147
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
136
click to vote
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
227
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
142
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...