Sciweavers

16666 search results - page 6 / 3334
» Descriptive and Computational Complexity
Sort
View
WSC
2004
13 years 8 months ago
A Generalized Multiple Response Surface Methodology for Complex Computer Simulation Applications
This work provides a generalization of the traditional response surface methodology (RSM) that can be applied to complex, multi-objective simulation studies. These problems involv...
Jeffrey B. Schamburg, Donald E. Brown
FCT
2003
Springer
14 years 18 days ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
DCC
2000
IEEE
13 years 11 months ago
Multiple Description Lattice Vector Quantization: Variations and Extensions
Multiple description lattice vector quantization (MDLVQ) is a technique for two-channel multiple description coding. We observe that MDLVQ, in the form introduced by Servetto, Vai...
Jonathan A. Kelner, Vivek K. Goyal, Jelena Kovacev...
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
14 years 1 months ago
A Computational Framework for Taxonomic Research: Diagnosing Body Shape within Fish Species Complexes
It is estimated that ninety percent of the world’s species have yet to be discovered and described. The main reason for the slow pace of new species description is that the scie...
Yixin Chen, Henry L. Bart Jr., Shuqing Huang, Huim...
ISLPED
1996
ACM
102views Hardware» more  ISLPED 1996»
13 years 11 months ago
High-level power estimation and the area complexity of Boolean functions
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
Mahadevamurty Nemani, Farid N. Najm