Sciweavers

3552 search results - page 510 / 711
» Proof theory in the abstract
Sort
View
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
16 years 1 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton
COMPGEOM
2009
ACM
16 years 1 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
IPPS
2008
IEEE
16 years 1 months ago
Software monitoring with bounded overhead
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
Sean Callanan, David J. Dean, Michael Gorbovitski,...
FOCS
2007
IEEE
16 years 27 days ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
16 years 27 days ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...