Sciweavers

1686 search results - page 295 / 338
» Programs as polygraphs: computability and complexity
Sort
View
CASES
2007
ACM
15 years 1 months ago
Application driven embedded system design: a face recognition case study
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
Karthik Ramani, Al Davis
CIA
2006
Springer
15 years 1 months ago
Conversation-Based Specification and Composition of Agent Services
There is great promise in the idea of having agent or web services available on the internet, that can be flexibly composed to achieve more complex services, which can themselves t...
Quoc Bao Vo, Lin Padgham
EMSOFT
2004
Springer
15 years 1 months ago
Separation of concerns: overhead in modeling and efficient simulation techniques
Separating the description of important aspects of a design such as behavior and architecture, or computation and communication, may yield significant advantages in design time as...
Guang Yang 0004, Alberto L. Sangiovanni-Vincentell...
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 1 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
ARCS
2008
Springer
14 years 11 months ago
An Optimized ZGEMM Implementation for the Cell BE
: The architecture of the IBM Cell BE processor represents a new approach for designing CPUs. The fast execution of legacy software has to stand back in order to achieve very high ...
Timo Schneider, Torsten Hoefler, Simon Wunderlich,...