Sciweavers

5962 search results - page 835 / 1193
» Efficient Clustering for Orders
Sort
View
NETWORKS
2008
15 years 6 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
PC
2006
96views Management» more  PC 2006»
15 years 6 months ago
Modeling Master/Worker applications for automatic performance tuning
Parallel application development is a very difficult task for non-expert programmers, and therefore support tools are needed for all phases of this kind of application development...
Eduardo César, Andreu Moreno, Joan Sorribes...
PR
2006
161views more  PR 2006»
15 years 6 months ago
Incremental wrapper-based gene selection from microarray data for cancer classification
Gene expression microarray is a rapidly maturing technology that provides the opportunity to assay the expression levels of thousands or tens of thousands of genes in a single exp...
Roberto Ruiz Sánchez, José Crist&oac...
AUTOMATICA
2005
137views more  AUTOMATICA 2005»
15 years 6 months ago
Multivariable frequency-response curve fitting with application to modal parameter estimation
This paper presents a computational approach for the frequency-domain identification of multivariable, discrete-time transfer function models based on a cost function minimization...
P. Verboven, P. Guillaume, B. Cauberghe
TEC
2008
98views more  TEC 2008»
15 years 6 months ago
Opposition-Based Differential Evolution
Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general we...
Shahryar Rahnamayan, Hamid R. Tizhoosh, Magdy M. A...