1722 search results - page 207 / 345 » Variables in Concept Graphs |
162
Voted
ECRTS
2002
IEEE
15 years 9 months ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
130
Voted
FM
2001
Springer
15 years 8 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
163
Voted
CC
2006
Springer
15 years 7 months ago
2006
Springer
We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...
136
Voted
CISSE
2008
Springer
15 years 5 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
113
click to vote
NIPS
2007
15 years 5 months ago
2007
Brain-Computer Interfaces can suffer from a large variance of the subject conditions within and across sessions. For example vigilance fluctuations in the individual, variable ta...