594 search results - page 92 / 119 » Using Approximation to Relate Computational Classes over the... |
LCPC
2004
Springer
14 years 2 months ago
2004
Springer
There is an increasing trends towards distributed and shared repositories for storing scientific datasets. Developing applications that retrieve and process data from such reposit...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
APSEC
2008
IEEE
14 years 3 months ago
2008
IEEE
Design and development scalability, in any engineering, requires information hiding and a specific composition mechanism in which composite items are made-up of other items. This ...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
We define and solve the problem of "distribution classification", and, in general, "distribution mining". Given n distributions (i.e., clouds) of multi-dimensi...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...