6110 search results - page 905 / 1222 » Approximate Computing |
168
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
159
click to vote
DIS
1998
Springer
15 years 11 months ago
1998
Springer
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
153
click to vote
DIS
1998
Springer
15 years 11 months ago
1998
Springer
The statistical information processing can be characterized by the likelihood function de ned by giving an explicit form for an approximation to the true distribution. This mathema...
244
click to vote
FOCS
1997
IEEE
15 years 10 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
170
click to vote
PPSN
1998
Springer
15 years 10 months ago
1998
Springer
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...