Sciweavers

4378 search results - page 575 / 876
» On the Complexity of Ordered Colourings
Sort
View
VLSI
2005
Springer
16 years 6 days ago
Modeling the Traffic Effect for the Application Cores Mapping Problem onto NoCs
This work addresses the problem of application mapping in networks-on-chip (NoCs) having as goal to minimize the total dynamic energy consumption of a complex system-on-a-chip (So...
César A. M. Marcon, José Carlos S. P...
186
Voted
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
16 years 6 days ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke
WLP
2005
Springer
16 years 6 days ago
Expressing Interaction in Combinatorial Auction through Social Integrity Constraints
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
Marco Alberti, Federico Chesani, Alessio Guerri, M...
XPU
2005
Springer
16 years 6 days ago
An Approach for Assessing Suitability of Agile Solutions: A Case Study
Dynamic market situation and changing customer requirements generate more demands for the product development. Product releases should be developed and managed in short iterations ...
Minna Pikkarainen, Ulla Passoja
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
16 years 5 days ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...