Sciweavers

850 search results - page 52 / 170
» heuristics 2006
Sort
View
COR
2006
108views more  COR 2006»
13 years 11 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
DISOPT
2006
90views more  DISOPT 2006»
13 years 11 months ago
Tree decompositions of graphs: Saving memory in dynamic programming
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
NN
2006
Springer
108views Neural Networks» more  NN 2006»
13 years 11 months ago
Performance analysis of LVQ algorithms: A statistical physics approach
Learning vector quantization (LVQ) constitutes a powerful and intuitive method for adaptive nearest prototype classification. However, original LVQ has been introduced based on he...
Anarta Ghosh, Michael Biehl, Barbara Hammer
INFOCOM
2006
IEEE
14 years 5 months ago
Channel Allocation in 802.11-Based Mesh Networks
— IEEE 802.11 (WiFi) has been used beyond its original intended purpose of a tether-free LAN. In this paper, we are interested in the use of 802.11 in mesh networks. Specificall...
Bhaskaran Raman
IJON
2000
81views more  IJON 2000»
13 years 10 months ago
Initialization by selection for wavelet network training
We present an original initialization procedure for the parameters of feedforward wavelet networks, prior to training by gradient-based techniques. It takes advantage of wavelet f...
Yacine Oussar, Gérard Dreyfus