925 search results - page 43 / 185 » A Solution to the Extended GCD Problem |
IFL
2001
Springer
14 years 7 days ago
2001
Springer
The parallel-functional language Eden extends Haskell with constructs to explicitly define and communicate processes. These extensions allow the easy definition of skeletons as h...
CATS
2008
13 years 9 months ago
2008
In this paper we examine an extension of the core concept for the 0/1 Multidimensional Knapsack Problem (MKP) towards general 0/1 Integer Programming (IP) by allowing negative pro...
IMSCCS
2006
IEEE
14 years 1 months ago
2006
IEEE
The properties of a LPAPI-matrix derived from an extended Direct-SIMPLE scheme are demonstrated. It is shown that such LPAPI-matrix for a 3D strong P V coupling problem is difficu...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...