OpenAlex
PricingAboutJobs
Log inGet started
Work

Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds

HTML

Year: 2011
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Principles and Practice of Constraint Programming – CP 2011: 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings
DOI: 10.1007/978-3-642-23786-7_50
Authors: Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo, Boi Faltings
Institutions: Kyushu University, École Polytechnique Fédérale de Lausanne
Language: English

Topic: Constraint Satisfaction and Optimization
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences

Open Access status: closed

Funder: Japan Society for the Promotion of Science
Awards: Study of SAT-based constraint optimization problem solving and its parallel distributed processing, Distributed Green Computing: Application of Distributed Optimization Technique to Environmental Issues
OpenAlex ID: W65750358
FWCI: 0.506
Cites: 20
Cited by: 13
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
Supporters
Legal
Privacy
Accessibility
Terms