16404 search results - page 702 / 3281 » A set coverage problem |
187
click to vote
EVOW
2008
Springer
15 years 9 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
221
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
175
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
197
click to vote
SIGMOD
1996
ACM
15 years 11 months ago
1996
ACM
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenanc...
188
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...