Publication

A hybrid of inference and local search for distributed combinatorial optimization

Boi Faltings
2007
Conference Papers

Abstract

We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decisions based only on local information, and full inference methods that guarantee completeness.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A hybrid of inference and local search for distributed combinatorial optimization

Chat with Graph Search

Neural Counterfactual Reasoning for Interacting Systems: Bridging Physics-Informed Learning and Reasoning for PHM

Synthesis and Testing of Minimum Energy Adaptive Structures

Venues in Social Media: Examining Ambiance Perception Through Scene Semantics