Sciweavers

7930 search results - page 597 / 1586
» Greedy in Approximation Algorithms
Sort
View
DOLAP
1999
ACM
15 years 11 months ago
Design and Selection of Materialized Views in a Data Warehousing Environment: A Case Study
In this paper, we describe the design of a data warehousing system for an engineering company ‘R’. This system aims to assist users in retrieving data for business analysis in...
Goretti K. Y. Chan, Qing Li, Ling Feng
HM
2007
Springer
155views Optimization» more  HM 2007»
15 years 11 months ago
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
Alexandre R. Duarte, Celso C. Ribeiro, Sebasti&aac...
GECCO
2009
Springer
15 years 11 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
COCOON
2008
Springer
15 years 9 months ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 9 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos