Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Link opens in a new tab
Search content at Bar-Ilan University
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
An asynchronous Branch-and-Bound DCOP algorithm
William Yeoh
, Ariel Felner
, Sven Koenig
University of Southern California
Ben-Gurion University of the Negev
Research output
:
Contribution to journal
›
Article
›
peer-review
136
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'An asynchronous Branch-and-Bound DCOP algorithm'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Distributed Constraint Optimization Problem
100%
Optimization Algorithm
100%
Branch-and-bound
100%
Optimization Search
30%
Bounded Error
30%
Approximation Mechanism
20%
Error Approximation
20%
Minimal Solution
20%
Relative Error Bound
20%
NP-hard
10%
Moderate Resolution Imaging Spectroradiometer (MODIS)
10%
Order of Magnitude
10%
Search Strategy
10%
Best-first Search
10%
Message Passing
10%
Communication Framework
10%
Error Bound
10%
Message Communication
10%
Agent Coordination
10%
With Memory
10%
Absolute Error
10%
Coordination Problems
10%
Branch-and-bound Search
10%
Asynchronous Algorithms
10%
Popular
10%
Constraints Cost
10%
Depth-first
10%
Computer Science
Constraint Optimization
100%
Branch-and-Bound Algorithm Design
100%
Constraint Optimization Problems
100%
Optimization Algorithm
100%
Searching Algorithm
50%
Approximation (Algorithm)
33%
Relative Error
33%
Minimal Solution
33%
Message Passing
16%
Experimental Result
16%
Search Strategies
16%