Sciweavers

837 search results - page 6 / 168
» Hard combinators
Sort
View
ATAL
2009
Springer
15 years 4 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
SAC
2008
ACM
14 years 9 months ago
Towards a model-driven engineering approach for developing embedded hard real-time software
Model-Driven Engineering (MDE) has been advocated as an effective way to deal with today's software complexity. MDE can be seen as an integrative approach combining existing ...
Fabiano Cruz, Raimundo S. Barreto, Lucas Cordeiro
RTSS
2003
IEEE
15 years 3 months ago
Data Caches in Multitasking Hard Real-Time Systems
Data caches are essential in modern processors, bridging the widening gap between main memory and processor speeds. However, they yield very complex performance models, which make...
Xavier Vera, Björn Lisper, Jingling Xue
FMCAD
2004
Springer
15 years 3 months ago
Non-miter-based Combinational Equivalence Checking by Comparing BDDs with Different Variable Orders
This paper describes a new method that is useful in combinational equivalence checking with very challenging industrial designs. The method does not build a miter; instead it build...
In-Ho Moon, Carl Pixley
ICCAD
1998
IEEE
66views Hardware» more  ICCAD 1998»
15 years 2 months ago
Tight integration of combinational verification methods
Combinational verification is an important piece of most equivalence checking tools. In the recent past, many combinational verification algorithms have appeared in the literature...
Jerry R. Burch, Vigyan Singhal