2957 search results - page 405 / 592 » The Complexity of Polynomial-Time Approximation |
152
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
160
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
163
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
In complex systems, like robot plants, applications are built on top of a set of components, or devices. Each of them has particular individual constraints, and there are also log...
151
click to vote
ICANN
2003
Springer
15 years 11 months ago
2003
Springer
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
178
click to vote
ICCBR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...