Sciweavers

5595 search results - page 227 / 1119
» Comparing Subsumption Optimizations
Sort
View
IJCAI
2007
15 years 7 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
NETWORKING
2007
15 years 7 months ago
Optimal Topology Design for Overlay Networks
Abstract. The topology creation is one of the most important step for the design of an overlay network. Traffic characteristic and volume, and behavior of nodes which can be sel...
Mina Kamel, Caterina M. Scoglio, Todd Easton
FLAIRS
2003
15 years 7 months ago
Optimal Approach for Temporal Patterns Discovery
This paper presents new technique for discovering temporal patterns when considered primitives are intervals. Apriori technique is the most used one to deal with temporal patterns...
Khellaf Bouandas, Aomar Osmani
154
Voted
WSC
2004
15 years 7 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
ICGA
1997
134views Optimization» more  ICGA 1997»
15 years 7 months ago
Local Search Genetic Algorithm for Optimization of Highly Reliable Communications Networks
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...
Berna Dengiz, Fulya Altiparmak, Alice E. Smith