1172 search results - page 167 / 235 » Path Algorithms on Regular Graphs |
142
click to vote
ICCI
1991
15 years 5 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
135
click to vote
DAC
1997
ACM
15 years 6 months ago
1997
ACM
: Hardware-software co-synthesis is the process of partitioning an embedded system specification into hardware and software modules to meet performance, power and cost goals. In t...
137
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
144
click to vote
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— This paper presents a solution to interactive navigation planning and real-time simulation of a very large number of entities moving in a virtual environment. From the ...
119
click to vote
STACS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...