Sciweavers

2657 search results - page 102 / 532
» On the complexity of hierarchical problem solving
Sort
View
ECAI
2008
Springer
15 years 3 months ago
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
Alfonso Gerevini, Ugur Kuter, Dana S. Nau, Alessan...
HICSS
2005
IEEE
139views Biometrics» more  HICSS 2005»
15 years 7 months ago
Complex Decision Making Processes: their Modelling and Support
Decision making processes and systems to support the same have focused for the most part on narrow disciplines, paradigms, perspectives, and pre-determined processes. Apart from t...
Angela Liew, David Sundaram
JSAC
2008
110views more  JSAC 2008»
15 years 1 months ago
Low complexity resource allocation with opportunistic feedback over downlink OFDMA networks
Abstract--Optimal tone allocation in downlink OFDMA networks is a non-convex NP-hard problem that requires extensive feedback for channel information. In this paper, two constantco...
Rajiv Agarwal, Vinay R. Majjigi, Zhu Han, Rath Van...
GRAMMARS
2002
119views more  GRAMMARS 2002»
15 years 1 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
LPAR
2010
Springer
14 years 12 months ago
On the Complexity of Model Expansion
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
Antonina Kolokolova, Yongmei Liu, David G. Mitchel...