Sciweavers

217 search results - page 30 / 44
» Backdoors To Typical Case Complexity
Sort
View
139
Voted
ER
1999
Springer
104views Database» more  ER 1999»
15 years 8 months ago
A Taxonomy of Recursive Relationships and Their Structural Validity in ER Modeling
Abstract. In this paper, we present the complete classification of recursive relationships and the criteria that contribute to the structural validity of modeling recursive relatio...
James Dullea, Il-Yeol Song
134
Voted
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
15 years 7 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
114
Voted
AAAI
2010
15 years 5 months ago
Evolving Compiler Heuristics to Manage Communication and Contention
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
Matthew E. Taylor, Katherine E. Coons, Behnam Roba...
128
Voted
FORTE
2008
15 years 5 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
136
Voted
IPCO
2007
126views Optimization» more  IPCO 2007»
15 years 5 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...