Sciweavers

2323 search results - page 396 / 465
» Power optimization for connectivity problems
Sort
View
112
Voted
ICPR
2008
IEEE
15 years 9 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
COLCOM
2005
IEEE
15 years 8 months ago
Location assisted routing for near-far effect mitigation in wireless networks
CDMA technology represents an attractive choice for various wireless ad hoc networks applications, due to its appealing properties, such as resistance to jamming and interference,...
Hassan Mahmood, Cristina Comaniciu
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 8 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
LCPC
2005
Springer
15 years 8 months ago
Dynamic Compilation for Reducing Energy Consumption of I/O-Intensive Applications
Tera-scale high-performance computing has enabled scientists to tackle very large and computationally challenging scientific problems, making the advancement of scientific discov...
Seung Woo Son, Guangyu Chen, Mahmut T. Kandemir, A...
ESOP
1999
Springer
15 years 6 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller