585 search results - page 57 / 117 » Better Abstractions for Timed Automata |
99
Voted
WEA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
WCNC
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—We tackle the problem of providing minimum datarate guarantees for different classes-of-service in an OFDMAbased network, while obtaining a high system throughput. Our a...
109
Voted
MICCAI
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We present a fast and accurate tool for semiautomatic segmentation of volumetric medical images based on the live wire algorithm, shape-based interpolation and a new opti...
82
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
109
click to vote
CASCON
1997
15 years 1 months ago
1997
Understanding distributed applications is a tedious and di cult task. Visualizations based on process-time diagrams are often used to obtain a better understanding of the executio...