2657 search results - page 219 / 532 » On the complexity of hierarchical problem solving |
WOLLIC
2009
Springer
15 years 8 months ago
2009
Springer
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
91
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called cl...
101
click to vote
SASO
2008
IEEE
15 years 8 months ago
2008
IEEE
As organization-based multiagent systems are applied to more complex problems, configuring and tuning the systems can become nearly as complex as the original problem a system wa...
113
click to vote
ICRA
2006
IEEE
15 years 8 months ago
2006
IEEE
— In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description l...
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...