Sciweavers

7106 search results - page 97 / 1422
» Restricted Complexity, General Complexity
Sort
View
VVEIS
2007
13 years 11 months ago
Checking Complex Compositions of Web Services Against Policy Constraints
Research in web services has allowed reusable, distributed, loosely coupled components which can easily be composed to build systems or to produce more complex services. Compositio...
Andrew Dingwall-Smith, Anthony Finkelstein
AMC
2008
78views more  AMC 2008»
13 years 10 months ago
Information processing in complex networks: Graph entropy and information functionals
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Matthias Dehmer
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
13 years 10 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 10 months ago
Reducing Tile Complexity for Self-Assembly Through Temperature Programming
We consider the tile self-assembly model and how tile complexity can be eliminated by permitting the temperature of the self-assembly system to be adjusted throughout the assembly...
Ming-Yang Kao, Robert T. Schweller
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 10 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