2227 search results - page 12 / 446 » Reversibility and Models for Concurrency |
SEKE
1993
Springer
14 years 1 months ago
1993
Springer
1 To handle the complexity of modern software systems, a software comprehension strategy pointing out the al abstraction level is necessary. In this context, the role of technology...
WSC
1997
13 years 11 months ago
1997
An efficient “Simulation Optimization” technique is developed to solve system design problems which can not be expressed in explicit analytical or mathematical models. In part...
CVPR
2007
IEEE
14 years 12 months ago
2007
IEEE
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...
SIGSOFT
1994
ACM
14 years 1 months ago
1994
ACM
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
COCOON
2006
Springer
14 years 1 months ago
2006
Springer
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...