Sciweavers

105 search results - page 10 / 21
» Dynamic Partial Order Reduction Using Probe Sets
Sort
View
CSCLP
2006
Springer
13 years 10 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
ISVLSI
2003
IEEE
157views VLSI» more  ISVLSI 2003»
14 years 4 hour ago
Joint Minimization of Power and Area in Scan Testing by Scan Cell Reordering
This paper describes a technique for re-ordering of scan cells to minimize power dissipation that is also capable of reducing the area overhead of the circuit compared to a random...
Shalini Ghosh, Sugato Basu, Nur A. Touba
EDBT
2009
ACM
117views Database» more  EDBT 2009»
13 years 10 months ago
A methodology for preference-based personalization of contextual data
The widespread use of mobile appliances, with limitations in terms of storage, power, and connectivity capability, requires to minimize the amount of data to be loaded on user’s...
Antonio Miele, Elisa Quintarelli, Letizia Tanca
FMICS
2006
Springer
13 years 10 months ago
Test Coverage for Loose Timing Annotations
Abstract. The design flow of systems-on-a-chip (SoCs) identifies several abstraction levels higher than the Register-Transfer-Level that constitutes the input of the synthesis tool...
Claude Helmstetter, Florence Maraninchi, Laurent M...
ECRTS
2006
IEEE
14 years 24 days ago
Optimal deadline assignment for periodic real-time tasks in dynamic priority systems
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified i...
Patricia Balbastre, Ismael Ripoll, Alfons Crespo