Now showing items 1-4 of 4
Adaptive Array Systems Using QR-Based RLS and CRLS Techniques with Systolic Array Architectures
In this dissertation the basic techniques for designing more sophisticated adaptive array systems are first developed. Then several systolic architectures based on numerically stable and computationally efficient algorithms ...
Complexity, Decidability and Undecidability Results for Domain- Independent Planning
In this paper, we examine how the complexity of domain- independent planning with STRIPS-like operators depends on the nature of the planning operators.<P>We show conditions under which planning is decidable and undecidable. ...
Exact, Recursive, Inference of Event Space Probability Law for Discrete Random Sets with Applications
In this paper we extend Choquet's result to obtain a recursive procedure for the computation of the underlying event-space probability law for Discrete Random Sets, based on Choquet's capacity functional. This is an important ...
On the Complexity of Blocks-World Planning
In this paper, we show that blocks-world planning is difficult, in the sense that finding an optimal plan is NP-hard. This is true regardless of whether or not, the goal state is completely specified, and regardless of ...