Sciweavers

6142 search results - page 37 / 1229
» The Complexity of Partition Functions
Sort
View
ESEM
2010
ACM
14 years 7 months ago
Introducing the evaluation of complexity in functional size measurement: a UML-based approach
Functional Size Measures are often used for effort estimation. However, these measures do not take into account the amount and complexity of elaboration required, concentrating in...
Luigi Lavazza, Gabriela Robiolo
VIS
2007
IEEE
120views Visualization» more  VIS 2007»
15 years 11 months ago
Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
Attila Gyulassy, Vijay Natarajan, Valerio Pascuc...
TSMC
1998
108views more  TSMC 1998»
14 years 9 months ago
The measurement of a design structural and functional complexity
— The complexity of a design process or a design artifact substantially influences their performance. When evaluation of terms such as “design complexity” and its “quality...
Dan Braha, Oded Maimon
IPL
2010
82views more  IPL 2010»
14 years 8 months ago
New upper bounds on the Boolean circuit complexity of symmetric functions
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
E. Demenkov, Arist Kojevnikov, Alexander S. Kuliko...
GLVLSI
2005
IEEE
124views VLSI» more  GLVLSI 2005»
15 years 3 months ago
SOFTENIT: a methodology for boosting the software content of system-on-chip designs
Embedded software is a preferred choice for implementing system functionality in modern System-on-Chip (SoC) designs, due to the high flexibility, and lower engineering costs pro...
Abhishek Mitra, Marcello Lajolo, Kanishka Lahiri