323 search results - page 17 / 65 » Verify Your Runs |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
FUIN
2010
13 years 6 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
CCR
2008
13 years 7 months ago
2008
This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. OpenFlow is based on an Ethernet switch, with an interna...
DAC
1998
ACM
14 years 8 months ago
1998
ACM
We describe the verification of the IM: a large, complex (12,000 gates and 1100 latches) circuit that detects and marks the boundaries between Intel architecture (IA-32) instructi...
CBSE
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Long running applications often need to adapt due to changing requirements or changing environment. Typically, such adaptation is performed by dynamically adding or remov...