Sciweavers

4934 search results - page 295 / 987
» complexity 2008
Sort
View
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Fast, quasi-optimal, and pipelined instruction-set extensions
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
Ajay K. Verma, Philip Brisk, Paolo Ienne
ATAL
2008
Springer
15 years 8 months ago
A domain specific modeling language for multiagent systems
Software systems are becoming more and more complex with a large number of interacting partners often distributed over a network. A common dilemma faced by software engineers in b...
Christian Hahn
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
15 years 8 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
EDOC
2008
IEEE
15 years 8 months ago
Supporting Service-Oriented Design with Metrics
The service-oriented architectural style is widely perceived today. However, service orientation is a very general concept and its application in real-life situations is somewhat ...
Helge Hofmeister, Guido Wirtz
ESWS
2008
Springer
15 years 8 months ago
dRDF: Entailment for Domain-Restricted RDF
Abstract. We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF...
Reinhard Pichler, Axel Polleres, Fang Wei, Stefan ...