2657 search results - page 89 / 532 » On the complexity of hierarchical problem solving |
TON
2008
15 years 1 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
118
click to vote
CORR
2002
Springer
15 years 1 months ago
2002
Springer
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
152
click to vote
AAMAS
2011
Springer
14 years 8 months ago
2011
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...
AIPS
1996
15 years 2 months ago
1996
Statistical exploratory data analysis (EDA) poses a di cult search problem. However, the EDA process lends itself to a planning formulation. We have built a system, called Aide, t...
107
click to vote
ANNPR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Hierarchical neural networks show many benefits when employed for classification problems even when only simple methods analogous to decision trees are used to retrieve t...