Sciweavers

1068 search results - page 103 / 214
» For completeness, sublogarithmic space is no space
Sort
View
ZUM
2005
Springer
142views Formal Methods» more  ZUM 2005»
14 years 2 months ago
Formal Program Development with Approximations
Abstract. We describe a method for combining formal program development with a disciplined and documented way of introducing realistic compromises, for example necessitated by reso...
Eerke A. Boiten, John Derrick
CP
2004
Springer
14 years 2 months ago
Quality of LP-Based Approximations for Highly Combinatorial Problems
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
Lucian Leahu, Carla P. Gomes
DATE
2003
IEEE
120views Hardware» more  DATE 2003»
14 years 2 months ago
Crosstalk Reduction in Area Routing
Interconnect delay dominates system delay in modern circuits, and with reduced feature sizes, coupling capacitance and signal crosstalk have become significant issues. By spacing...
Ryon M. Smey, Bill Swartz, Patrick H. Madden
HOTOS
2003
IEEE
14 years 2 months ago
FAB: Enterprise Storage Systems on a Shoestring
Abstract—A Federated Array of Bricks (FAB) is a logical disk system that provides the reliability and performance of enterprise-class disk arrays, at a fraction of the cost and w...
Svend Frølund, Arif Merchant, Yasushi Saito...
CSL
2003
Springer
14 years 2 months ago
A Logic for Probability in Quantum Systems
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
Ron van der Meyden, Manas Patra