Sciweavers

381 search results - page 42 / 77
» Time Complexity of genetic algorithms on exponentially scale...
Sort
View
GLOBECOM
2009
IEEE
14 years 2 months ago
Design of Signal Constellation Rearrangement (CoRe) for Multiple Relay Links
Abstract – This paper considers a design of signal constellations for trans-modulation (constellation rearrangement: CoRe) in a relay system with the multiple links in which the ...
Jin Woo Kim, Hee S. Lee, Jae Yung Ahn, Chung Gu Ka...
DATE
2004
IEEE
154views Hardware» more  DATE 2004»
13 years 11 months ago
Fast Exploration of Parameterized Bus Architecture for Communication-Centric SoC Design
For successful SoC design, efficient and scalable communication architecture is crucial. Some bus interconnects now provide configurable structures to meet this requirement of an ...
Chulho Shin, Young-Taek Kim, Eui-Young Chung, Kyu-...
AIPS
2008
13 years 10 months ago
From One to Many: Planning for Loosely Coupled Multi-Agent Systems
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
Ronen I. Brafman, Carmel Domshlak
RTSS
2002
IEEE
14 years 19 days ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...
CVPR
2010
IEEE
14 years 4 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff