3653 search results - page 233 / 731 » On Recognizable Timed Languages |
180
click to vote
ICALP
1994
Springer
15 years 11 months ago
1994
Springer
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
202
click to vote
PLDI
1993
ACM
15 years 11 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
197
click to vote
POS
1994
Springer
15 years 11 months ago
1994
Springer
With the emerging of 10 Gbps Ethernet, modern storage networks allow the hosts to access remote cache nearly as quickly as they can access from their local storages. Aiming at imp...
169
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
176
click to vote
JSS
2007
15 years 7 months ago
2007
The paper presents a method to compute performance metrics (response time, sojourn time, throughput) on Unified Modeling Language design. The method starts with UML design annota...