1647 search results - page 271 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
RSA
2008
13 years 8 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
TCOM
2010
13 years 7 months ago
2010
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...
COLT
2007
Springer
14 years 3 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
AUSAI
2007
Springer
14 years 27 days ago
2007
Springer
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
ICCAD
2001
IEEE
14 years 5 months ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...