1279 search results - page 123 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
157
click to vote
TEC
2010
14 years 11 months ago
2010
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
220
click to vote
IPL
2006
15 years 4 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
121
click to vote
RECSYS
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
138
click to vote
TPDS
2008
15 years 4 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
167
click to vote
FOIKS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...