14190 search results - page 104 / 2838 » Abstractions for hybrid systems |
155
click to vote
ESA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
144
click to vote
DATE
2000
IEEE
15 years 10 months ago
2000
IEEE
c Abstraction for Worst-Case Analysis of Discrete Systems Felice Balarin Cadence Berkeley Laboratories Recently, a methodology for worst-case analysis of discrete systems has been...
144
click to vote
CODES
1999
IEEE
15 years 10 months ago
1999
IEEE
se Analysis of Discrete Systems Based on Conditional Abstractions Felice Balarin Cadence Berkeley Laboratories
166
click to vote
ATAL
2009
Springer
16 years 29 days ago
2009
Springer
ion in model checking multi-agent systems Mika Cohen Department of Computing Imperial College London London, UK Mads Dam Access Linnaeus Center Royal Institute of Technology Stockh...
149
click to vote
FM
2009
Springer
16 years 29 days ago
2009
Springer
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...