Sciweavers

206 search results - page 35 / 42
» Efficient adaptive collect using randomization
Sort
View
EOR
2006
135views more  EOR 2006»
13 years 7 months ago
Principles of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
Rafael Martí, Manuel Laguna, Fred Glover
EWSN
2008
Springer
14 years 7 months ago
FiGaRo: Fine-Grained Software Reconfiguration for Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are increasingly being proposed in scenarios whose requirements cannot be fully predicted, or where the system functionality must adapt to changing ...
Luca Mottola, Gian Pietro Picco, Adil Amjad Sheikh
MM
2004
ACM
248views Multimedia» more  MM 2004»
14 years 27 days ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He
CP
2009
Springer
14 years 8 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
IPPS
2010
IEEE
13 years 5 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke