Sciweavers

963 search results - page 133 / 193
» On Computation of Performance Bounds of Optimal Index Assign...
Sort
View
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
15 years 3 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
IPPS
2010
IEEE
14 years 7 months ago
On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
Olivier Beaumont, Hejer Rejeb
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 2 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
GECCO
2006
Springer
198views Optimization» more  GECCO 2006»
15 years 1 months ago
Reward allotment in an event-driven hybrid learning classifier system for online soccer games
This paper describes our study into the concept of using rewards in a classifier system applied to the acquisition of decision-making algorithms for agents in a soccer game. Our a...
Yuji Sato, Yosuke Akatsuka, Takenori Nishizono
WIOPT
2010
IEEE
14 years 7 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely