Sciweavers

1246 search results - page 164 / 250
» Recursive Timed Automata
Sort
View
ML
2010
ACM
159views Machine Learning» more  ML 2010»
15 years 1 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
FUIN
2007
114views more  FUIN 2007»
15 years 2 months ago
Cellular Devices and Unary Languages
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
Andreas Klein, Martin Kutrib
141
Voted
TCS
2002
15 years 2 months ago
Specification of real-time and hybrid systems in rewriting logic
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...
Peter Csaba Ölveczky, José Meseguer
IEICET
2006
114views more  IEICET 2006»
15 years 2 months ago
Synchronization Verification in System-Level Design with ILP Solvers
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...
Thanyapat Sakunkonchak, Satoshi Komatsu, Masahiro ...
ICFP
2005
ACM
16 years 2 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney