6315 search results - page 141 / 1263 » Approximating Solution Structure |
146
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
193
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
160
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
161
click to vote
ICDT
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
189
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...