2850 search results - page 335 / 570 » On Timed Models and Full Abstraction |
170
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Abstract— In this paper we study the testability of circuits derived from Binary Decision Diagrams (BDDs) under the bridging fault model. It is shown that testability can be form...
194
click to vote
ICANN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Local air quality forecasting can be made on the basis of meteorological and air pollution time series. Such data contain redundant information. Partial mutual informatio...
264
click to vote
IANDC
2008
15 years 6 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
203
click to vote
CCS
2005
ACM
16 years 7 days ago
2005
ACM
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions...
202
click to vote
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...