Sciweavers

106 search results - page 11 / 22
» A randomized on-line algorithm for the k-server problem on a...
Sort
View
JDWM
2006
104views more  JDWM 2006»
13 years 7 months ago
Navigation Rules for Exploring Large Multidimensional Data Cubes
Navigating through multidimensional data cubes is a nontrivial task. Although On-Line Analytical Processing (OLAP) provides the capability to view multidimensional data through ro...
Navin Kumar, Aryya Gangopadhyay, George Karabatis,...
ADC
2003
Springer
162views Database» more  ADC 2003»
14 years 21 days ago
Automated Data Warehousing for Rule-based CRM Systems
This paper proposes a novel way of automatically developing data warehouse configuration in rule-based CRM systems. Rule-based CRM systems assume that marketing activities are re...
Han-joon Kim, Taehee Lee, Sang-goo Lee, Jonghun Ch...
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
11 years 10 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
14 years 26 days ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
ICRA
2000
IEEE
124views Robotics» more  ICRA 2000»
13 years 12 months ago
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
Joaquín Bautista, Raúl Suárez...