Sciweavers

515 search results - page 37 / 103
» A Reduced Complexity Algorithm for Minimizing N-Detect Tests
Sort
View
109
Voted
ICSE
2009
IEEE-ACM
15 years 9 months ago
Deployment automation with BLITZ
Minimizing the computing infrastructure (such as processors) in a distributed real-time embedded (DRE) system deployment helps reduce system size, weight, power consumption, and c...
Brian Dougherty, Jules White, Jaiganesh Balasubram...
140
Voted
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
15 years 7 months ago
Using memetic algorithms to improve portfolio performance in static and dynamic trading scenarios
The Portfolio Optimization problem consists of the selection of a group of assets to a long-term fund in order to minimize the risk and maximize the return of the investment. This...
Claus de Castro Aranha, Hitoshi Iba
124
Voted
TIP
2010
162views more  TIP 2010»
14 years 9 months ago
Multivariate Image Segmentation Using Semantic Region Growing With Adaptive Edge Penalty
Multivariate image segmentation is a challenging task, influenced by large intraclass variation that reduces class distinguishability as well as increased feature space sparseness ...
A. K. Qin, David A. Clausi
101
Voted
ICCS
2003
Springer
15 years 7 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
114
Voted
EURODAC
1994
IEEE
129views VHDL» more  EURODAC 1994»
15 years 6 months ago
Synthesis of Self-Testable Controllers
The paper presents a synthesis approach for pipelinelike controller structures. These structures allow to implement a built-in self-test in two sessions without any extra test reg...
Sybille Hellebrand, Hans-Joachim Wunderlich