2957 search results - page 276 / 592 » The Complexity of Polynomial-Time Approximation |
182
click to vote
WDAG
1990
Springer
15 years 11 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
233
click to vote
EAAI
2010
15 years 5 months ago
2010
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
161
click to vote
JC
2011
15 years 2 months ago
2011
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
221
click to vote
TSP
2010
15 years 1 months ago
2010
We propose a novel equalization method for doubly selective wireless channels, whose taps are represented by an arbitrary Basis Expansion Model (BEM). We view such a channel in the...
187
click to vote
GECCO
2010
Springer
16 years 3 hour ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...