Sciweavers

188 search results - page 2 / 38
» An Algorithm for Solving Systems of Linear Diophantine Equat...
Sort
View
SYNASC
2008
IEEE
266views Algorithms» more  SYNASC 2008»
13 years 12 months ago
On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter
We present an algorithm for solving Diophantine equations which are linear in the variables, but non-linear in one parameter. This enables us to compute data dependences in more ge...
Armin Größlinger, Stefan Schuster
IPPS
1998
IEEE
13 years 10 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
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 ...
Peter R. Cappello, Ömer Egecioglu
CSB
2005
IEEE
135views Bioinformatics» more  CSB 2005»
13 years 11 months ago
Inverse Design of Large Molecules using Linear Diophantine Equations
We have previously developed a method [1] for the inverse design of small ligands. This method can be used to design novel compounds with optimized properties (such as drugs) and ...
Shawn Martin, W. Michael Brown, Jean-Loup Faulon, ...
CORR
2008
Springer
149views Education» more  CORR 2008»
13 years 5 months ago
Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
Ori Shental, Danny Bickson, Paul H. Siegel, Jack K...
SIGMETRICS
2008
ACM
13 years 5 months ago
A Diophantine model of routes in structured P2P overlays
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...
Dmitry Korzun, Andrei Gurtov