Sciweavers

3367 search results - page 173 / 674
» Incremental assignment problem
Sort
View
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 9 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
CORR
1999
Springer
98views Education» more  CORR 1999»
15 years 3 months ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 10 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
ICSE
1995
IEEE-ACM
15 years 7 months ago
Software Requirements Negotiation and Renegotiation Aids: A Theory-W Based Spiral Approach
A major problem in requirements engineering is obtaining requirements that address the concerns of multiple stakeholders. An approach to such a problem is the Theory-W based Spira...
Barry W. Boehm, Prasanta K. Bose, Ellis Horowitz, ...
149
Voted
DAM
2011
14 years 10 months ago
Minimum sum set coloring of trees and line graphs of trees
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
Flavia Bonomo, Guillermo Durán, Javier Mare...