Sciweavers

8413 search results - page 237 / 1683
» Ordering Problem Subgoals
Sort
View
83
Voted
ICPP
1993
IEEE
15 years 5 months ago
Parallel Computation of the Singular Value Decomposition on Tree Architectures
We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to min...
Bing Bing Zhou, Richard P. Brent
JDCTA
2010
272views more  JDCTA 2010»
14 years 7 months ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...
109
Voted
JMIV
2010
115views more  JMIV 2010»
14 years 7 months ago
Generalized Convexity in Multiple View Geometry
Recent work on geometric vision problems has exploited convexity properties in order to obtain globally optimal solutions. In this paper we give an overview of these developments a...
Carl Olsson, Fredrik Kahl
95
Voted
JOT
2007
96views more  JOT 2007»
15 years 21 days ago
Aspect Composition in the Motorola Aspect-Oriented Modeling Weaver
One of the fundamental issues in Aspect-Oriented approaches is aspect-to-aspect interference, which occurs when multiple aspects are deployed jointly such that different compositi...
Jing Zhang, Thomas Cottenier, Aswin van den Berg, ...
123
Voted
AAAI
2008
15 years 3 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann