Sciweavers

4451 search results - page 503 / 891
» On Random Ordering Constraints
Sort
View
GECCO
2000
Springer
200views Optimization» more  GECCO 2000»
15 years 10 months ago
Chemical Crossover
During chemical reactions, molecules interact to produce new molecules. Some of the reaction mechanisms are very close to the way gene combine to produce new genes. Like the class...
Hugues Bersini
HT
1991
ACM
15 years 10 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
EDBT
2009
ACM
131views Database» more  EDBT 2009»
15 years 10 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
DAMON
2008
Springer
15 years 8 months ago
Modeling the performance of algorithms on flash memory devices
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
Kenneth A. Ross
IJCAI
2001
15 years 8 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...