299 search results - page 32 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
108
click to vote
ISAAC
2009
Springer
15 years 5 months 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...
102
click to vote
MP
2008
15 years 12 days 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...
80
Voted
TCOM
2008
15 years 11 days 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
15 years 6 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 (...
125
Voted
ASPDAC
2010
ACM
14 years 10 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...