Sciweavers

1523 search results - page 192 / 305
» The Computational Complexity of Linear Optics
Sort
View
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
15 years 10 months ago
Fast positive-real balanced truncation of symmetric systems using cross Riccati equations
We present a computationally efficient implementation of positive-real balanced truncation (PRBT) for symmetric multiple-input multiple-output (MIMO) systems. The solution of a p...
Ngai Wong
ICC
2007
IEEE
125views Communications» more  ICC 2007»
15 years 10 months ago
On Bit Error Robustness of Trellis Source Codes
— Trellis codes based on linear congruential recursions have recently been introduced as powerful source codes. For a modest computational complexity they offer excellent rate di...
Tomas Eriksson, Norbert Goertz
ICRA
2005
IEEE
121views Robotics» more  ICRA 2005»
15 years 9 months ago
Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning
Abstract— High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion p...
Erion Plaku, Lydia E. Kavraki
SIGECOM
2005
ACM
153views ECommerce» more  SIGECOM 2005»
15 years 9 months ago
Marginal contribution nets: a compact representation scheme for coalitional games
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
Samuel Ieong, Yoav Shoham
ASM
2005
ASM
15 years 9 months ago
State Exploration with Multiple State Groupings
Abstract. Exploration algorithms are relevant to the industrial practice of gentest cases from an abstract state machine whose runs define the predicted behavior of the software s...
Colin Campbell, Margus Veanes