Sciweavers

2657 search results - page 69 / 532
» On the complexity of hierarchical problem solving
Sort
View
ICASSP
2008
IEEE
15 years 8 months ago
On quantifying the effects of noncircularity on the complex fastica algorithm
The complex fast independent component analysis (c-FastICA) algorithm is one of the most popular methods for solving the ICA problem with complex-valued data. In this study, we ex...
Mike Novey, Tülay Adali
ICCAD
2000
IEEE
84views Hardware» more  ICCAD 2000»
15 years 5 months ago
Timing Driven Gate Duplication: Complexity Issues and Algorithms
This paper addresses the issue of timing driven gate duplication for delay optimization. Gate duplication has been used extensively for cutset minimization but the usefulness in m...
Ankur Srivastava, Ryan Kastner, Majid Sarrafzadeh
CF
2006
ACM
15 years 5 months ago
Performance characteristics of an adaptive mesh refinement calculation on scalar and vector platforms
Adaptive mesh refinement (AMR) is a powerful technique that reduces the resources necessary to solve otherwise intractable problems in computational science. The AMR strategy solv...
Michael L. Welcome, Charles A. Rendleman, Leonid O...
CDC
2010
IEEE
14 years 8 months ago
Synthesis using approximately bisimilar abstractions: time-optimal control problems
s using Approximately Bisimilar Abstractions: Time-Optimal Control Problems Antoine Girard In this paper, we present a hierarchical approach to time-optimal control using approxima...
Antoine Girard
WOA
2001
15 years 2 months ago
Implementing Adaptive Capabilities on Agents that Act in a Dynamic Environment
Acting in a dynamic environment is a complex task that requires several issues to be investigated, with the aim of controlling the associated search complexity. In this paper, a l...
Giuliano Armano, Giancarlo Cherchi, Eloisa Vargiu