229 search results - page 13 / 46 » Bilateral Algorithms for Symbolic Abstraction |
ICTAC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
FATES
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
IJCAI
1997
13 years 9 months ago
1997
In teaching case-based argumentation skills, the CATO program, an intelligent learning environment, guides students' assessments of partial matches between problems and cases...
FMCAD
2007
Springer
13 years 11 months ago
2007
Springer
Abstract--Analog and mixed signal (AMS) designs are important integrated circuits that are usually needed at the interface between the electronic system and the real world. Recentl...