2168 search results - page 275 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
166
click to vote
MEMICS
2010
14 years 11 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
155
click to vote
EOR
2010
15 years 4 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
135
click to vote
SIGMETRICS
2008
ACM
15 years 4 months ago
2008
ACM
Performance of WLANs has been extensively studied during the past few years. While the focus has mostly been on isolated cells, the coverage of WLANs is in practice most often rea...
150
click to vote
PROMISE
2010
14 years 11 months ago
2010
Background: Automated diagnosis of software defects can drastically increase debugging efficiency, improving reliability and time-to-market. Current, low-cost, automatic fault dia...
111
click to vote
ISQED
2005
IEEE
15 years 10 months ago
2005
IEEE
Layout migration has re-emerged as an important task due to the increasing use of library hard intellectual properties. While recent advances of migration tools have accommodated ...