Sciweavers

8298 search results - page 70 / 1660
» On the Complexity of Numerical Analysis
Sort
View
SMA
2003
ACM
154views Solid Modeling» more  SMA 2003»
15 years 11 months ago
Discretization of functionally based heterogeneous objects
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
Elena Kartasheva, Valery Adzhiev, Alexander A. Pas...
ACMSE
2007
ACM
15 years 10 months ago
High-resolution displays enhancing geo-temporal data visualizations
Intelligence analysis is difficult due to the volume and complexity of the data, as well as the subtlety of the connections that have to be made in order to identify threats. Info...
John Booker, Timothy Buennemeyer, Andrew J. Sabri,...
ICC
2007
IEEE
121views Communications» more  ICC 2007»
16 years 14 days 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
AAAI
2012
13 years 8 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...
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 6 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
Bageshri Karkare, Uday P. Khedker