1191 search results - page 31 / 239 » Completeness and Performance Of The APO Algorithm |
IPPS
2002
IEEE
14 years 22 days ago
2002
IEEE
Systemic pathways-oriented approaches to analysis of metabolic networks are effective for small networks but are computationally infeasible for genome scale networks. Current comp...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
We give the first complete theoretical convergence analysis for the iterative extensions of the Sturm/Triggs algorithm. We show that the simplest extension, SIESTA, converges to no...
CCGRID
2010
IEEE
13 years 9 months ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
COMGEO
2010
ACM
13 years 8 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
GLOBECOM
2007
IEEE
13 years 9 months ago
2007
IEEE
— 1 In this paper, we investigate the proportional fair scheduling (PFS) problem for multiuser OFDM systems, considering the impact of packet length. Packet length influences sc...