Sciweavers

313 search results - page 19 / 63
» Complete Local Search with Memory
Sort
View
WEBDB
2007
Springer
159views Database» more  WEBDB 2007»
14 years 4 months ago
A clustering-based sampling approach for refreshing search engine's database
Due to resource constraints, search engines usually have difficulties keeping the local database completely synchronized with the Web. To detect as many changes as possible, the ...
Qingzhao Tan, Ziming Zhuang, Prasenjit Mitra, C. L...
WWW
2008
ACM
14 years 10 months ago
Spatial variation in search engine queries
Local aspects of Web search -- associating Web content and queries with geography -- is a topic of growing interest. However, the underlying question of how spatial variation is m...
Lars Backstrom, Jon M. Kleinberg, Ravi Kumar, Jasm...
COR
2011
13 years 4 months ago
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
Kerem Bülbül
PCI
2005
Springer
14 years 3 months ago
Tuning Blocked Array Layouts to Exploit Memory Hierarchy in SMT Architectures
Cache misses form a major bottleneck for memory-intensive applications, due to the significant latency of main memory accesses. Loop tiling, in conjunction with other program tran...
Evangelia Athanasaki, Kornilios Kourtis, Nikos Ana...
NIPS
2004
13 years 11 months ago
Rate- and Phase-coded Autoassociative Memory
Areas of the brain involved in various forms of memory exhibit patterns of neural activity quite unlike those in canonical computational models. We show how to use well-founded Ba...
Máté Lengyel, Peter Dayan