Results 251 to 260 of about 47,568 (277)
Some of the next articles are maybe not open access.
Meta-Heuristics and Channel Assignment
2002Abstract The channel (or frequency) assignment problem CAP (or FAP) arises in various forms and is a computationally hard problem to solve. In the 1960s and 1970s the effort was directed at developing simple greedy methods, heuristic methods (Zoellner and Beall 1977; Box 1978), and in very specialized cases, exact methods.
Stephen Hurley, Derek Smith
openaire +1 more source
Meta-heuristic approach to proportional fairness
Evolutionary Intelligence, 2012Proportional fairness is a concept from resource sharing tasks among n users, where each user receives at least 1/n of her or his total value of the infinitely divisible resource. Here we provide an approach to proportional fairness that allows its extension to discrete domains, as well as for the direct application of evolutionary computation to ...
Mario Köppen +3 more
openaire +1 more source
A meta heuristic for graph drawing
Proceedings of the working conference on Advanced visual interfaces, 2000The problem of finding a pleasant layout for a given graph is a key challenge in the field of information visualization. For graphs that are biased towards a particular property such as tree-like, star-like, or bipartite, a layout algorithm can produce excellent layouts—if this property is actually detected.Typically, a graph may not be of such a ...
Oliver Niggemann, Benno Stein
openaire +1 more source
Evolutionary Computation and Meta-heuristics
2020This chapter presents several methods of evolutionary computation and meta-heuristics. Evolutionary computation is a computation technique that mimics the evolutionary mechanism of life to select, deform, and convolute data structures. Because of its high versatility, its applications are found in various fields.
openaire +1 more source
Designing Parallel Meta-Heuristic Methods
2014Meta-heuristics represent powerful tools for addressing hard combinatorial optimization problems. However, real life instances usually cannot be treated efficiently in “reasonable” computing times. Moreover, a major issue in meta-heuristic design and calibration is to provide high performance solutions for a variety of problems.
Teodor Gabriel Crainic +2 more
openaire +1 more source
Meta heuristics for prime factorization problem
2013 World Congress on Nature and Biologically Inspired Computing, 2013Generally, cryptographic algorithms are based on NP-Complete problems like prime factorization, discrete logarithm etc. The difficulties of RSA and Rabin cryptographic algorithms are based on prime factorization problem. Prime factorization problem may be modeled as a Non-uniform discrete optimization problem.
Pranav Dass +3 more
openaire +1 more source
Meta–heuristics for Portfolio Optimization: Part I — Review of Meta–heuristics
2023Kyle Erwin, Andries Engelbrecht
openaire +1 more source
Parking recommendation with meta-heuristic algorithms
Theoretical and Natural ScienceDue to the exponential growth of cars in urban areas, parking problems have become a significant concern. Addressing this issue requires efficient methods for locating available parking spaces, enhancing the overall experience for drivers. This paper introduces a parking lot recommendation model leveraging meta-heuristic algorithms to generate a list ...
Siyuan Wu, Tingting Yang
openaire +1 more source
Local search and meta-heuristic algorithms
2020Suboptimal schedules for intractable time-dependent scheduling problems may be found by using various algorithms. In this chapter, closing the fifth part of the book, we consider local search and meta-heuristic algorithms.
openaire +1 more source