Agents’ Strategies for the Dual Parallel Search in Partnership Formation Applications

2006 ◽  
pp. 158-172 ◽  
Author(s):  
David Sarne ◽  
Sarit Kraus
Keyword(s):  
Parallel Search ◽  
Partnership Formation

A Local Parallel Search Approach for Memory Failure Pattern Identification

2016 ◽  
Vol 65 (3) ◽  
pp. 770-780 ◽  
Author(s):  
Bing-Yang Lin ◽  
Cheng-Wen Wu ◽  
Mincent Lee ◽  
Hung-Chih Lin ◽  
Ching-Nen Peng ◽  
...  
Keyword(s):  
Pattern Identification ◽  
Failure Pattern ◽  
Parallel Search ◽  
Memory Failure ◽  
Search Approach

There is No Evidence That Kanizsa-Type Subjective Contours Can Be Detected in Parallel

Perception ◽  
1996 ◽  
Vol 25 (7) ◽  
pp. 861-874 ◽  
Author(s):  
Rick Gurnsey ◽  
Frédéric J A M Poirier ◽  
Eric Gascon
Keyword(s):  
Visual Search ◽  
Control Problem ◽  
Search Task ◽  
Visual Search Task ◽  
Physiological Data ◽  
Sufficient Information ◽  
Parallel Search ◽  
High Contrast ◽  
Psychophysical Data ◽  
Area V2

Davis and Driver presented evidence suggesting that Kanizsa-type subjective contours could be detected in a visual search task in a time that is independent of the number of nonsubjective contour distractors. A linking connection was made between these psychophysical data and the physiological data of Peterhans and von der Heydt which showed that cells in primate area V2 respond to subjective contours in the same way that they respond to luminance-defined contours. Here in three experiments it is shown that there was sufficient information in the displays used by Davis and Driver to support parallel search independently of whether subjective contours were present or not. When confounding properties of the stimuli were eliminated search became slow whether or not subjective contours were present in the display. One of the slowest search conditions involved stimuli that were virtually identical to those used in the physiological studies of Peterhans and von der Heydt to which Davis and Driver wish to link their data. It is concluded that while subjective contours may be represented in the responses of very early visual mechanisms (eg in V2) access to these representations is impaired by high-contrast contours used to induce the subjective contours and nonsubjective figure distractors. This persistent control problem continues to confound attempts to show that Kanizsa-type subjective contours can be detected in parallel.

scholarly journals Embarrassingly Parallel Search in Constraint Programming

2016 ◽  
Vol 57 ◽  
pp. 421-464 ◽  
Author(s):  
Arnaud Malapert ◽  
Jean-Charles Régin ◽  
Mohamed Rezgui
Keyword(s):  
Cloud Computing ◽  
Efficient Method ◽  
Data Centers ◽  
Optimization Problems ◽  
State Of The Art ◽  
Parallel Search ◽  
Simple Method ◽  
Constraint Solver ◽  
Average Performance ◽  
Depth Analysis

We introduce an Embarrassingly Parallel Search (EPS) method for solving constraint problems in parallel, and we show that this method matches or even outperforms state-of-the-art algorithms on a number of problems using various computing infrastructures. EPS is a simple method in which a master decomposes the problem into many disjoint subproblems which are then solved independently by workers. Our approach has three advantages: it is an efficient method; it involves almost no communication or synchronization between workers; and its implementation is made easy because the master and the workers rely on an underlying constraint solver, but does not require to modify it. This paper describes the method, and its applications to various constraint problems (satisfaction, enumeration, optimization). We show that our method can be adapted to different underlying solvers (Gecode, Choco2, OR-tools) on different computing infrastructures (multi-core, data centers, cloud computing). The experiments cover unsatisfiable, enumeration and optimization problems, but do not cover first solution search because it makes the results hard to analyze. The same variability can be observed for optimization problems, but at a lesser extent because the optimality proof is required. EPS offers good average performance, and matches or outperforms other available parallel implementations of Gecode as well as some solvers portfolios. Moreover, we perform an in-depth analysis of the various factors that make this approach efficient as well as the anomalies that can occur. Last, we show that the decomposition is a key component for efficiency and load balancing.

Sign in / Sign up

Export Citation Format

Share Document