Sciweavers

427 search results - page 63 / 86
» A Subexponential Bound for Linear Programming
Sort
View
ET
2006
55views more  ET 2006»
13 years 8 months ago
Test Planning and Test Resource Optimization for Droplet-Based Microfluidic Systems
Recent years have seen the emergence of dropletbased microfluidic systems for safety-critical biomedical applications. In order to ensure reliability, microsystems incorporating m...
Fei Su, Sule Ozev, Krishnendu Chakrabarty
MP
2008
99views more  MP 2008»
13 years 8 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 8 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
ICASSP
2011
IEEE
13 years 17 days ago
Design of UEP-based MSE-minimizing rateless codes for source-channel coding
This paper proposes a method to optimize the performance of tandem source–channel coding with respect to the mean-squared error by exploiting the unequal error protection coding...
Amirpasha Shirazinia, Lei Bao, Mikael Skoglund
ESOP
2010
Springer
14 years 6 months ago
Amortised Resource Analysis with Separation Logic
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
Robert Atkey