11 years 7 months ago
The Complexity of Planning Revisited - A Parameterized Analysis
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
Christer Bäckström, Yue Chen, Peter Jons...
11 years 7 months ago
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf ...

12 years 3 months ago
The Age of Analog Networks.
A large class of systems of biological and technological relevance can be described as analog networks, that is, collections of dynamic devices interconnected by links of varying s...
Claudio Mattiussi, Daniel Marbach, Peter Dürr, Da...
12 years 8 months ago
A novel multi-view learning developed from single-view patterns
The existing Multi-View Learning (MVL) learns how to process patterns with multiple information sources. In generalization this MVL is proven to have a significant advantage over...
Zhe Wang, Songcan Chen, Daqi Gao
12 years 8 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
13 years 6 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
13 years 6 months ago
Forward-Chaining Planning in Nondeterministic Domains
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
Ugur Kuter, Dana S. Nau
13 years 9 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
121views Communications» more  ICC 2007»
13 years 11 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc