Sciweavers

8497 search results - page 279 / 1700
» Design for an Optimal Probe
Sort
View
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 10 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
FCCM
2007
IEEE
165views VLSI» more  FCCM 2007»
15 years 8 months ago
Sparse Matrix-Vector Multiplication Design on FPGAs
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
Junqing Sun, Gregory D. Peterson, Olaf O. Storaasl...
ADBIS
2010
Springer
333views Database» more  ADBIS 2010»
15 years 7 months ago
Horizontal Partitioning by Predicate Abstraction and Its Application to Data Warehouse Design
al Partitioning by Predicate Abstraction and its Application to Data Warehouse Design Aleksandar Dimovski1 , Goran Velinov2 , and Dragan Sahpaski2 1 Faculty of Information-Communic...
Aleksandar Dimovski, Goran Velinov, Dragan Sahpask...
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
TIP
2010
155views more  TIP 2010»
15 years 5 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He