Sciweavers

3228 search results - page 630 / 646
» Computationally Sound Proofs
Sort
View
SMC
2007
IEEE
125views Control Systems» more  SMC 2007»
14 years 2 months ago
Scaling with digital connection: Services innovation
—Digitization of production factors, including the knowledge for knowledge workers and consumers, opens almost infinite potential to connect persons, systems, processes, enterpri...
Cheng Hsu
TPHOL
2007
IEEE
14 years 2 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 2 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
DRM
2007
Springer
14 years 2 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 2 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn