417 search results - page 3 / 84 » Fast Methods for Solving Linear Diophantine Equations |
109
click to vote
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
105
click to vote
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
SIGMETRICS
2008
ACM
14 years 11 months ago
2008
ACM
Abstract-- An important intrinsic property of any structured Peer-to-Peer (P2P) overlay is multi-hop paths. Understanding their structure helps to solve challenging problems relate...
103
click to vote
IMCSIT
2010
14 years 9 months ago
2010
The aim of this paper is to show that a special kind of boundary value problem for second-order ordinary differential equations which reduces to the problem of solving a tridiagona...
112
click to vote
IANDC
2008
14 years 11 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...