Sciweavers

17288 search results - page 74 / 3458
» Hybrid Optimizations: Which Optimization Algorithm to Use
Sort
View
ICML
2005
IEEE
14 years 11 months ago
Robust one-class clustering using hybrid global and local search
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
Gunjan Gupta, Joydeep Ghosh
ATAL
2005
Springer
14 years 3 months ago
Impact of problem centralization in distributed constraint optimization algorithms
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...
John Davin, Pragnesh Jay Modi
CISS
2008
IEEE
14 years 4 months ago
Optimizing redundancy using MDS codes and dynamic symbol allocation in mobile ad hoc networks
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...
Anna Kacewicz, Stephen B. Wicker
HM
2007
Springer
135views Optimization» more  HM 2007»
14 years 4 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik
AAAI
2008
14 years 21 days ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings