ALGORITHMICA
2011
13 years 6 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
ALGORITHMICA
2011
13 years 6 months ago
2011
ALGORITHMICA
2011
13 years 6 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
AIS
2011
Springer
13 years 6 months ago
2011
Springer
AIEDAM
2011
13 years 6 months ago
2011
In familiar design domains, expert designers are able to quickly focus on “good designs”, based on constraints they have learned while exploring the design space. This ability ...
AI
2011
Springer
13 years 6 months ago
2011
Springer
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...
AI
2011
Springer
13 years 6 months ago
2011
Springer
ating Abstract Argumentation with Classical Logic Arguments: Postulates and Properties Nikos Gorogiannisa , Anthony Hunterb,∗ aDepartment of Computer Science, Queen Mary, Univers...
AI
2011
Springer
13 years 6 months ago
2011
Springer
AI
2011
Springer
13 years 6 months ago
2011
Springer
AI
2011
Springer
13 years 6 months ago
2011
Springer
