152 search results - page 28 / 31 » An Experimental Study of Random Knapsack Problems |
SIGMETRICS
2011
ACM
12 years 9 months ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
SIGMOD
2010
ACM
13 years 11 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
GECCO
2006
Springer
13 years 10 months ago
2006
Springer
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...
KDD
2005
ACM
14 years 7 months ago
2005
ACM
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...