Sciweavers

2747 search results - page 506 / 550
» Non-oblivious Strategy Improvement
Sort
View
NETWORKS
2008
14 years 10 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
MONET
2006
107views more  MONET 2006»
14 years 10 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao
NCA
2006
IEEE
14 years 10 months ago
Evolutionary training of hardware realizable multilayer perceptrons
The use of multilayer perceptrons (MLP) with threshold functions (binary step function activations) greatly reduces the complexity of the hardware implementation of neural networks...
Vassilis P. Plagianakos, George D. Magoulas, Micha...
PR
2008
85views more  PR 2008»
14 years 10 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders
IIE
2007
73views more  IIE 2007»
14 years 10 months ago
Exploiting Open-source Projects to Study Software Design
This article presents an approach to using open-source tools and open-source projects to add realistic and practical examples to a course on software design in a professional maste...
Christopher P. Fuhrman