4110 search results - page 193 / 822 » Efficient algorithms for the 2-gathering problem |
176
click to vote
SIGMOD
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
162
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
185
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
168
click to vote
TEC
2002
15 years 6 months ago
2002
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
185
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...