1818 search results - page 249 / 364 » Granularity-Adaptive Proof Presentation |
150
click to vote
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
158
click to vote
ASIAN
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
152
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
164
click to vote
MKM
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. There are many styles for the narrative structure of a mathematical document. Each mathematician has its own conventions and traditions about labeling portions of texts (...
171
click to vote
ACL2
2006
ACM
16 years 11 days ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...