Sciweavers

1507 search results - page 4 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
CAISE
2003
Springer
14 years 19 days ago
No-redundant Metrics for UML Class Diagram Structural Complexity
In software engineering it is widely acknowledged that the usage of metrics at the initial phases of the object oriented software life cycle can help designers to make better decis...
M. Esperanza Manso, Marcela Genero, Mario Piattini
GECCO
2004
Springer
14 years 24 days ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
ETFA
2008
IEEE
13 years 9 months ago
Functional and structural properties in the Model-Driven Engineering approach
In this paper we discuss the separation between attributes on functionality and on structure following an approach based on Model Driven Engineering (MDE). We adopt a methodologic...
Daniela Cancila, Roberto Passerone
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 7 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking