Sciweavers

1289 search results - page 156 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
SASO
2010
IEEE
14 years 7 months ago
Designing Comprehensible Self-Organising Systems
Self-organising systems are a popular engineering concept for designing decentralised autonomic computing systems. They are able to find solutions in complex and versatile problem ...
Nicolas Höning, Han La Poutré
ICCD
2004
IEEE
107views Hardware» more  ICCD 2004»
15 years 6 months ago
Network-on-Chip: The Intelligence is in The Wire
In this paper we describe how Network-on-Chip (NoC) will be the next major challenge to implementing complex and function-rich applications in advanced manufacturing processes at ...
Gérard Mas, Philippe Martin
ATAL
2004
Springer
15 years 3 months ago
Decentralized Markov Decision Processes with Event-Driven Interactions
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
ASAP
2003
IEEE
141views Hardware» more  ASAP 2003»
15 years 3 months ago
Automatic Instruction Set Extension and Utilization for Embedded Processors
There is a growing demand for application-specific embedded processors in system-on-a-chip designs. Current tools and design methodologies often require designers to manually spec...
Armita Peymandoust, Laura Pozzi, Paolo Ienne, Giov...
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 1 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot