Sciweavers

9842 search results - page 146 / 1969
» Problem complexity
Sort
View
ISORC
2006
IEEE
15 years 4 months ago
Complexity Management for Composable Real-Time Systems
Embedded real-time systems are becoming increasingly complex due to ever increasing size and functionality so that complexity management is of growing importance, especially in de...
Bernhard Rumpler
AAAI
1990
14 years 11 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini
TCBB
2008
73views more  TCBB 2008»
14 years 10 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
FOCS
2003
IEEE
15 years 3 months ago
Polynomial Degree vs. Quantum Query Complexity
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
Andris Ambainis
CEC
2005
IEEE
14 years 12 months ago
Co-evolutionary modular neural networks for automatic problem decomposition
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
Vineet R. Khare, Xin Yao, Bernhard Sendhoff, Yaoch...