3228 search results - page 340 / 646 » Computationally Sound Proofs |
127
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
146
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Reconfigurable computing systems have already shown their abilities to accelerate embedded hardware/ software systems. Since standard processor-based embedded applications have co...
128
click to vote
PPOPP
2009
ACM
16 years 4 months ago
2009
ACM
Dependence-aware transactional memory (DATM) is a recently proposed model for increasing concurrency of memory transactions without complicating their interface. DATM manages depe...
113
click to vote
VLSID
2006
IEEE
16 years 4 months ago
2006
IEEE
Many formal verification tools today are based on Boolean proof techniques. The two most powerful approaches in this context are Binary Decision Diagrams (BDDs) and methods based ...
133
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...