Sciweavers

1332 search results - page 117 / 267
» Combinatorial Algorithms
Sort
View
APWEB
2003
Springer
14 years 2 months ago
An Ant Algorithm Based Dynamic Routing Strategy for Mobile Agents
Routing strategy is one of the most important aspects in a mobile agent system, which is a complex combinatorial problem. Most of current mobile agent systems adopt static routing ...
Dan Wang, Ge Yu, Mingsong Lv, Baoyan Song, Derong ...
CRYPTO
2008
Springer
100views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
Abstract. This paper discusses key recovery and universal forgery attacks on several MAC algorithms based on universal hash functions. The attacks use a substantial number of verif...
Helena Handschuh, Bart Preneel
ICGA
1997
134views Optimization» more  ICGA 1997»
13 years 10 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
AI
2006
Springer
13 years 9 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
JAIR
2007
141views more  JAIR 2007»
13 years 9 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf