Results 1  10
of
197
On the Multisearching Problem for Hypercubes
 Parallel Architectures and Languages Europe
, 1994
"... In this paper we give improved bounds for the multisearch problem on a hypercube. This is a parallel search problem where the elements in the structure S to be searched are totally ordered, but where it is not possible to compare in constant time any two given queries q and q 0. More precisely, we a ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this paper we give improved bounds for the multisearch problem on a hypercube. This is a parallel search problem where the elements in the structure S to be searched are totally ordered, but where it is not possible to compare in constant time any two given queries q and q 0. More precisely, we
Direct Multisearch for Multiobjective Optimization
, 2010
"... In practical applications of optimization it is common to have several conflicting objective functions to optimize. Frequently, these functions are subject to noise or can be of blackbox type, preventing the use of derivativebased techniques. We propose a novel multiobjective derivativefree metho ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
In practical applications of optimization it is common to have several conflicting objective functions to optimize. Frequently, these functions are subject to noise or can be of blackbox type, preventing the use of derivativebased techniques. We propose a novel multiobjective derivative
The Complexity of Parallel Multisearch on Coarse Grained Machines
, 1996
"... Given m ordered segments that form a partition of some universe (e.g., a 2D strip), the multisearch problem consists of determining, for a set of n query points in the universe, the segments they belong to. We present the first nontrivial parallel deterministic scheme for performing multisearch whe ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and of the BSP* parameters. We show that optimal performance can be obtained using logarithmic redundancy. We also prove a lower bound on the communication requirements of any deterministic multisearch scheme realized on a distributed memory machine. The lower bound exhibits a tradeoff between the redundancy
Distributed multisearch and resource selction for the TREC
 Million Query Track, 17th Text REtrieval Conference, NIST Special Publications
, 2008
"... A distributed information retrieval system with resource‐selection and result‐set merging capability was used to search subsets of the GOV2 document corpus for the 2008 TREC Million Query Track. The GOV2 collection was partitioned into host‐name subcollections and distributed to multiple remote mach ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
machines. The Multisearch demonstration application restricted each search to a fraction of the available sub‐collections that was pre‐determined by a resource‐selection algorithm. Experiment results from topic‐by‐topic resource selection and aggregate topic resource selection are compared. The sensitivity
Randomized FullyScalable BSP Techniques for MultiSearching and Convex Hull Construction
 In ACMSIAM Symposium on Discrete Algorithms
, 1997
"... We study randomized techniques for designing efficient algorithms on a pprocessor bulksynchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processortoprocessor communication rounds provided each processor is guaranteed to send and receive at most h items ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
items in any round. The measure of efficiency we use is in terms of the internal computation time of the processors and the number of communication rounds needed to solve the problem at hand. We present techniques that achieve optimal efficiency in these bounds over all possible values for p, and we
The Deterministic Complexity of Parallel Multisearch (Extended Abstract)
 PROCEEDINGS OF 5TH SWAT '96, SPRINGER LNCS 1097, 1996
, 1996
"... Given m ordered segments that form a partition of some universe (e.g., a 2D strip), the multisearch problem consists of determining, for a set of n query points in the universe, the segments they belong to. We present the first parallel deterministic scheme that efficiently solves the problem in th ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Given m ordered segments that form a partition of some universe (e.g., a 2D strip), the multisearch problem consists of determining, for a set of n query points in the universe, the segments they belong to. We present the first parallel deterministic scheme that efficiently solves the problem
Blocking in Parallel Multisearch Problems (Extended Abstract)
, 1998
"... ) Wolfgang Dittrich Bosch Telecom GmbH, UCON/ERS Gerberstrae 33 71522 Backnang, Germany Wolfgang.Dittrich@bk.bosch.de David Hutchinson y School of Computer Science Carleton University Ottawa, Canada K1S 5B6 hutchins@scs.carleton.ca Anil Maheshwari z School of Computer Science Carleto ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
in the design of efficient EM algorithms. A similar requirement arises in the transmission of data between processors in certain parallel computation models such as BSP* and CGM, for which blockwise communication is a crucial issue. We consider multisearch problems, where a large number of queries
Multisearch Techniques: Parallel Data Structures on MeshConnected Computers
 Journal of Parallel and Distributed Computing
, 1994
"... The {\em multisearch problem} is defined as follows. Given a data structure $D$ modeled as a graph with $n$ constantdegree nodes, perform $O(n)$ searches on $D$. Let $r$ be the length of the longest search path associated with a search process, and assume that the paths are determined ``online&apo ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
hierarchical search DAGs. Multisearch is a useful abstraction that can be used to implement parallel versions of standard sequential data structures on a mesh. As example applications, we consider a variety of parallel online tree traversals, as well as hierarchical representations of polyhedra and its myriad
An FPGA implementation of a multicomparand multisearch associative processor
 LNCS
, 2002
"... The multicomparand associative search paradigm is shown to be efficient in processing complex search problems from many application areas including computational geometry, graph theory, and list/matrix computations. In this paper the first FPGA implementation of a small multicomparand multise ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The multicomparand associative search paradigm is shown to be efficient in processing complex search problems from many application areas including computational geometry, graph theory, and list/matrix computations. In this paper the first FPGA implementation of a small multicomparand multisearch
Multisearch Techniques: Parallel Data Structures on MeshConnected Computers
, 1996
"... The multisearch problem is de ned as follows. Given a data structure D modeled as a graph with n constantdegree nodes, perform O(n) searches on D. Let r be the length of the longest search path associated with a search process, and assume that the paths are determined \online". That is, t ..."
Abstract
 Add to MetaCart
The multisearch problem is de ned as follows. Given a data structure D modeled as a graph with n constantdegree nodes, perform O(n) searches on D. Let r be the length of the longest search path associated with a search process, and assume that the paths are determined \online". That is
Results 1  10
of
197