Sciweavers

3913 search results - page 157 / 783
» complexity 2006
Sort
View
ESOA
2006
15 years 7 months ago
An Analysis and Design Concept for Self-organization in Holonic Multi-agent Systems
Holonic Multi-Agent Systems (HMAS) are a convenient way to engineer complex and open systems. In such systems, agents have to be able to self-organize to satisfy their goals. Our w...
Sebastian Rodriguez, Nicolas Gaud, Vincent Hilaire...
FPL
2006
Springer
135views Hardware» more  FPL 2006»
15 years 7 months ago
FPGA Design Considerations in the Implementation of a Fixed-Throughput Sphere Decoder for MIMO Systems
A field-programmable gate array (FPGA) implementation of a new detection algorithm for uncoded multiple inputmultiple output (MIMO) systems based on the complex version of the sph...
Luis G. Barbero, John S. Thompson
FSE
2006
Springer
95views Cryptology» more  FSE 2006»
15 years 7 months ago
Cryptanalysis of Achterbahn
We present several attacks against Achterbahn, one of the new stream ciphers proposed to the eSTREAM competition. Our best attack breaks the reduced version of the cipher with comp...
Thomas Johansson, Willi Meier, Frédé...
CSREAEEE
2006
118views Business» more  CSREAEEE 2006»
15 years 5 months ago
Analyzing and Modeling a Multiparty Outsourcing Environment
: This paper discusses the complexities involved in managing and monitoring the delivery of IT services in a multiparty outsourcing environment. The complexities identified are gro...
S. David Peter, K. Poulose Jacob, Sreela Sasi
IPL
2006
69views more  IPL 2006»
15 years 4 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...