5055 search results - page 295 / 1011 » Relative Timing |
193
click to vote
SODA
1990
ACM
15 years 8 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
172
click to vote
CGF
2006
15 years 7 months ago
2006
In this paper we describe a new method for generating and controlling physically-realistic motion of complex articulated characters. Our goal is to create motion from scratch, whe...
204
Voted
CORR
2007
Springer
15 years 7 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
182
click to vote
DAM
2007
15 years 7 months ago
2007
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
193
click to vote
CCE
2004
15 years 7 months ago
2004
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...