Sciweavers

1289 search results - page 29 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
CCE
2004
13 years 10 months ago
A decomposition method for synthesizing complex column configurations using tray-by-tray GDP models
This paper describes an optimization procedure for the synthesis of complex distillation configurations. A superstructure based on the Reversible Distillation Sequence Model (RDSM...
Mariana Barttfeld, Pío A. Aguirre, Ignacio ...
IJCGA
2010
155views more  IJCGA 2010»
13 years 9 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
CEC
2009
IEEE
14 years 3 months ago
Memory-enhanced Evolutionary Robotics: The Echo State Network Approach
— Interested in Evolutionary Robotics, this paper focuses on the acquisition and exploitation of memory skills. The targeted task is a well-studied benchmark problem, the Tolman ...
Cédric Hartland, Nicolas Bredeche, Mich&egr...
DAC
1998
ACM
14 years 3 months ago
Synthesis of Power-Optimized and Area-Optimized Circuits from Hierarchical Behavioral Descriptions
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
Ganesh Lakshminarayana, Niraj K. Jha
ICASSP
2011
IEEE
13 years 2 months ago
Sparsity-undersampling tradeoff of compressed sensing in the complex domain
In this paper, recently developed ONE-L1 algorithms for compressed sensing are applied to complex-valued signals and sampling matrices. The optimal and iterative solution of ONE-L...
Zai Yang, Cishen Zhang