Sciweavers

2842 search results - page 183 / 569
» Expansion and Search in Networks
Sort
View
ICPP
2005
IEEE
16 years 4 days ago
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
Sang Cheol Kim, Sunggu Lee
HEURISTICS
2002
99views more  HEURISTICS 2002»
15 years 6 months ago
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, ...
JMLR
2002
102views more  JMLR 2002»
15 years 6 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
NOTERE
2010
15 years 1 months ago
Experimental assessment of the TARGET adaptive ontology-based Web search framework
Finding relevant information on the Web can be a complex task for most of the users. Although Web search applications are improving, they still need to be more intelligent to adapt...
Nicolas Guelfi, Cédric Pruski, Chantal Reyn...
WEBI
2009
Springer
16 years 1 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova