Sciweavers

16666 search results - page 418 / 3334
» Descriptive and Computational Complexity
Sort
View
176
Voted
ICC
2007
IEEE
137views Communications» more  ICC 2007»
16 years 1 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy
SIGOPSE
2004
ACM
16 years 8 days ago
An approach to benchmarking configuration complexity
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
Aaron B. Brown, Joseph L. Hellerstein
SIAMSC
2008
125views more  SIAMSC 2008»
15 years 6 months ago
Hybrid Simulations of Reaction-Diffusion Systems in Porous Media
Abstract. Hybrid or multiphysics algorithms provide an efficient computational tool for combining micro- and macroscale descriptions of physical phenomena. Their use becomes impera...
Alexandre M. Tartakovsky, Daniel M. Tartakovsky, T...
203
Voted
APSEC
2005
IEEE
16 years 15 days ago
Architectural Style - Based Modeling and Simulation of Complex Software Systems
The design and development of complex software systems is a difficult task, and it is not easy to ensure the quality of a developed software. The paper presents an architectural ...
Ping Guo, Gregor Engels, Reiko Heckel
201
Voted
COCO
1995
Springer
134views Algorithms» more  COCO 1995»
15 years 10 months ago
Towards Average-Case Complexity Analysis of NP Optimization Problems
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
Rainer Schuler, Osamu Watanabe