283 search results - page 53 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
SIAMSC
2008
13 years 7 months ago
2008
We study preconditioners for the iterative solution of the linear systems arising in the implicit time integration of the compressible Navier-Stokes equations. The spatial discreti...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...