3134 search results - page 89 / 627 » Computing full disjunctions |
137
click to vote
JSAT
2010
14 years 9 months ago
2010
The design of a SAT-solver or the modification of an existing one is always followed by a phase of intensive testing of the solver on a benchmark of instances. This task can be ve...
149
click to vote
SIGECOM
2011
ACM
14 years 5 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
137
Voted
ECCV
2006
Springer
16 years 4 months ago
2006
Springer
An original concept for computing instantaneous 3D pose and 3D velocity of fast moving objects using a single view is proposed, implemented and validated. It takes advantage of the...
108
click to vote
KDD
2005
ACM
16 years 2 months ago
2005
ACM
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
139
click to vote
SOSP
2003
ACM
15 years 11 months ago
2003
ACM
We present a flexible architecture for trusted computing, called Terra, that allows applications with a wide range of security requirements to run simultaneously on commodity har...