Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Muhammed Basharu

dblp:31/2911 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Multi-agent systems · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems › distributed problem solving
distributed constraint satisfaction
0.112005
Solving DisCSPs with Penalty Driven Search · AAAI 2005

Methods — techniques the papers use, named apart from their topics

penalty driven search · 0.1
YearPublicationVenuePosition
2010 Solving coarse-grained DisCSPs with local search
abstract
Distributed constraint satisfaction problems (DisCSPs) are often used to solve problems which are naturally distributed over a number of agents on different locations who cooperate to solve the overall problem. One common assumption in DisCSP resolut
Inés Arana, Hatem Ahriz, Muhammed Basharu
Web Intell. Agent Syst.3
2005 Solving DisCSPs with Penalty Driven Search
Muhammed Basharu, Inés Arana, Hatem Ahriz
AAAI1
2003 FeReRA: A Multi-agent Approach to Constraint Satisfaction
Muhammed Basharu
CP1