R
Roie Zivan
Researcher at Ben-Gurion University of the Negev
Publications - 84
Citations - 1595
Roie Zivan is an academic researcher from Ben-Gurion University of the Negev. The author has contributed to research in topics: Distributed constraint optimization & Local search (optimization). The author has an hindex of 21, co-authored 80 publications receiving 1436 citations. Previous affiliations of Roie Zivan include Carnegie Mellon University.
Papers
More filters
Journal ArticleDOI
Asynchronous forward bounding for distributed COPs
TL;DR: The asynchronous forward bounding algorithm (AFB) algorithm as mentioned in this paper is a distributed optimization search algorithm that keeps one consistent partial assignment at all times, and is further enhanced by the addition of a backjumping mechanism.
Journal ArticleDOI
Explorative anytime local search for distributed constraint optimization
TL;DR: This empirical study considers various scenarios including random, realistic, and structured problems and reveals the advantage of the use of the proposed heuristics in the anytime framework over state-of-the-art local search algorithms.
Journal ArticleDOI
Distributed constraint optimization for teams of mobile sensing agents
TL;DR: It is demonstrated how a search-and-detection team responsible for finding new targets and a surveillance sub-team tasked with coverage of known targets can effectively work together to improve performance while using the DCOP_MST framework to coordinate.
Journal ArticleDOI
Message delay and DisCSP search algorithms
Roie Zivan,Amnon Meisels +1 more
TL;DR: A model for distributed performance measures for measuring performance of distributed search algorithms is presented and the delay of messages is found to have a strong negative effect on single search process algorithms, whether synchronous or asynchronous.
Journal ArticleDOI
Asynchronous Forward-checking for DisCSPs
Amnon Meisels,Roie Zivan +1 more
TL;DR: A new search algorithm for solving distributed constraint satisfaction problems (DisCSP) is presented and AFC with ordering heuristics outperforms ABT by a large factor on the harder instances of random DisCSPs.