886 search results - page 133 / 178 » Reasoning with contextual graphs |
144
click to vote
CASES
2004
ACM
15 years 7 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
126
Voted
DIAGRAMS
2006
Springer
15 years 7 months ago
2006
Springer
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
143
click to vote
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
129
click to vote
AAAI
2010
15 years 5 months ago
2010
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
113
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...