Sciweavers

192 search results - page 38 / 39
» Comparing two approaches to dynamic, distributed constraint ...
Sort
View
GIS
2002
ACM
13 years 5 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
OOPSLA
2010
Springer
13 years 4 months ago
G-Finder: routing programming questions closer to the experts
Programming forums are becoming the primary tools for programmers to find answers for their programming problems. Our empirical study of popular programming forums shows that the...
Wei Li, Charles Zhang, Songlin Hu
CP
2005
Springer
13 years 11 months ago
Neighbourhood Clause Weight Redistribution in Local Search for SAT
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, ...
DASFAA
2005
IEEE
209views Database» more  DASFAA 2005»
13 years 11 months ago
PADS: Protein Structure Alignment Using Directional Shape Signatures
A novel approach for similarity search on the protein structure databases is proposed. PADS (Protein Alignment by Directional shape Signatures) incorporates the three dimensional ...
S. Alireza Aghili, Divyakant Agrawal, Amr El Abbad...
ISPASS
2005
IEEE
13 years 11 months ago
Partitioning Multi-Threaded Processors with a Large Number of Threads
Today’s general-purpose processors are increasingly using multithreading in order to better leverage the additional on-chip real estate available with each technology generation...
Ali El-Moursy, Rajeev Garg, David H. Albonesi, San...