14548 search results - page 2514 / 2910 » The Optimal Path-Matching Problem |
192
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
187
click to vote
SSDBM
2000
IEEE
15 years 11 months ago
2000
IEEE
In a previous paper [Shoshani et al 99], we described a system called STACS (Storage Access Coordination System) for High Energy and Physics (HEP) experiments. These experiments g...
167
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
This paper presents a technique for adapting existing motion of a human-like character to have the desired features that are specified by a set of constraints. This problem can b...
152
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper considers the problem of determining an optimal clock skew schedule for a synchronous VLSI circuit. A novel formulation of clock skew scheduling as a constrained quadrat...
187
click to vote
ICDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...