OpenAlex
PricingAboutJobs
Log inGet started
Work

Local Search Based Approximate Algorithm for Multi-Objective DCOPs

HTML

Year: 2014
Type: conference-paper
Source: Lecture notes in computer science
Parent work: PRIMA 2014: Principles and Practice of Multi-Agent Systems
DOI: 10.1007/978-3-319-13191-7_32
Authors: Maxime Wack, Tenda Okimoto, Maxime Clement, Katsumi Inoue
Institutions: Institut polytechnique de Grenoble, Kobe University, The Graduate University for Advanced Studies, SOKENDAI, National Institute of Informatics
Language: English

Topic: Constraint Satisfaction and Optimization
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Keywords: Pareto front, approximate algorithms, local search, Pareto local search, agent cooperation, multi-objective optimization

Open Access status: green

Funder: Japan Society for the Promotion of Science
Awards: Modeling and Inference of Resilient Systems, Algorithm for Dynamic Multi-Objective Distributed Constraint Optimization, Realization of High-Performance and Flexible Constraint Programming Systems Using Propositional Inference Techniques
OpenAlex ID: W257398761
FWCI: 0.167
Cites: 25
Cited by: 3
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security