299 search results - page 32 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
ISAAC
2009
Springer
14 years 6 days ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
MP
2008
13 years 7 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
TCOM
2008
13 years 7 months ago
2008
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
ICSOC
2007
Springer
14 years 1 months ago
2007
Springer
Web services are rapidly emerging as a popular standard for sharing data and functionality among heterogeneous systems. We propose a general purpose Web Service Management System (...
ASPDAC
2010
ACM
13 years 5 months ago
2010
ACM
Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. Th...