Results 281 to 290 of about 709,020 (315)
Some of the next articles are maybe not open access.

Optimization on directionally convex sets

Central European Journal of Operations Research, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Optimizations of Rough Set Model

Fundamenta Informaticae, 1998
Rough set methodology is based on concept (set) approximations constructed from available background knowledge represented in information systems [14]. In many applications only partial knowledge about approximated concepts is given. Hence quite often first a parametrized family of concept approximations is built and next, by parameters tuning the best,
openaire   +2 more sources

Optimal Sampling Sets in Cographs

2019 IEEE Data Science Workshop (DSW), 2019
In this paper, we calculate the optimal sampling sets for bandlimited signals on cographs. We take into account the tree structure of the cograph to derive closed form results for the uniqueness sets of signals with a given bandwidth. These results do not require expensive spectral decompositions and represent a promising tool for the analysis of ...
Dominique Guillot   +3 more
openaire   +1 more source

Lifts of convex sets in optimization

Mathematical Programming, 2015
This special issue is dedicated to the geometry and complexity of lifts or extended formulations of convex sets which has been an active area of research in recent years. This developing field lies at the intersection of several areas such as convex geometry, polyhedral theory, real algebraic geometry, combinatorics, optimization, and computer science,
Volker Kaibel, Rekha R. Thomas
openaire   +1 more source

Working sets and near-optimality

ACM SIGOPS Operating Systems Review, 1983
In [1] Denning concludes from numerous observations of program behaviour that the WS algorithm with a single window size 8 is likely to "deliver throughput typically no worse than 10 percent from optimum". The authors of [2] report about observations of a set of programs, which requires several different window sizes for a i0 percent detuned WS ...
Hermann Schmutz, P. Silberbusch
openaire   +1 more source

On Set-Based Multiobjective Optimization

IEEE Transactions on Evolutionary Computation, 2010
Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: 1) how to formalize what type of Pareto set approximation is sought; 2) how to use this information within an algorithm to efficiently search for a good Pareto set approximation; and 3) how to ...
Eckart Zitzler   +2 more
openaire   +1 more source

Improvement sets and vector optimization

European Journal of Operational Research, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
César Gutiérrez   +2 more
openaire   +2 more sources

Optimal Approximations with Rough Sets

2013
When arbitrary sets are approximated by more structured sets, it may not be possible to obtain an exact approximation that is equivalent to a given set. A proposal is presented for a 'metric' approach to Rough Sets. This includes a definition of the 'optimal' or best approximation with respect to a measure of similarity, and an algorithm to find it ...
Ryszard Janicki, Adam Lenarcic
openaire   +1 more source

Aggregates in Answer Set Optimization

2011
Answer set optimization (ASO) is a flexible framework for qualitative optimization in answer set programming (ASP). The approach uses a generating program to construct the space of problem solutions, and a preference program to assess the quality of solutions.
Emad Saad, Gerhard Brewka
openaire   +1 more source

Optimal approximations of complete sets

1986
Orponen, Russo, and Sch6ning [0RS85] investigated the notion of polynomially levelable sets and showed that many "natural" intractable sets are polynomially levelable. For example, they show that i f a set is not in P and is "paddable" or "self-reducible" then i t is also polynomially levelable. Their results are suff ic ient ly powerful to show that i
openaire   +1 more source

Home - About - Disclaimer - Privacy