Sciweavers

4118 search results - page 73 / 824
» Efficient Algorithms for Airline Problem
Sort
View
ACIIDS
2012
IEEE
307views Database» more  ACIIDS 2012»
13 years 5 months ago
A Hybrid Evolutionary Imperialist Competitive Algorithm (HEICA)
This paper proposes a new approach by combining the Evolutionary Algorithm and Imperialist Competitive Algorithm. This approach tries to capture several people involved in communit...
Fatemeh Ramezani, Shahriar Lotfi, M. A. Soltani-Sa...
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
14 years 7 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 1 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
15 years 1 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
ENTCS
2008
108views more  ENTCS 2008»
14 years 10 months ago
E-matching for Fun and Profit
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
Michal Moskal, Jakub Lopuszanski, Joseph R. Kiniry