110 search results - page 10 / 22 » New Upper Bounds for Maximum Satisfiability |
ICCS
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
NA
2010
14 years 6 months ago
2010
The defect of a continuous approximate solution to an ODE is the amount by which that approximation fails to satisfy the ODE. A number of studies have explored the use of asymptot...
122
click to vote
TWC
2010
14 years 6 months ago
2010
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
105
click to vote
FORMATS
2009
Springer
15 years 3 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
86
Voted
TIT
2011
14 years 6 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...