Modern meta-heuristics based on nonlinear physics processes: A review of models and design procedures
S Salcedo-Sanz - Physics Reports, 2016 - Elsevier
Meta-heuristic algorithms are problem-solving methods which try to find good-enough
solutions to very hard optimization problems, at a reasonable computation time, where …
solutions to very hard optimization problems, at a reasonable computation time, where …
[BOOK][B] Analysis of boolean functions
R O'Donnell - 2014 - books.google.com
Boolean functions are perhaps the most basic objects of study in theoretical computer
science. They also arise in other areas of mathematics, including combinatorics, statistical …
science. They also arise in other areas of mathematics, including combinatorics, statistical …
[BOOK][B] Handbook of constraint programming
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
[BOOK][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
[PDF][PDF] The valorization of surveillance: Towards a political economy of Facebook
NS Cohen - Democratic Communiqué, 2008 - openpublishing.library.umass.edu
Much excitement surrounds Facebook, the social networking site based on user-generated
content that has attracted 64 million active users since its inception in 2004. This paper …
content that has attracted 64 million active users since its inception in 2004. This paper …
The coral reefs optimization algorithm: a novel metaheuristic for efficiently solving optimization problems
This paper presents a novel bioinspired algorithm to tackle complex optimization problems:
the coral reefs optimization (CRO) algorithm. The CRO algorithm artificially simulates a coral …
the coral reefs optimization (CRO) algorithm. The CRO algorithm artificially simulates a coral …
Parameterized complexity and approximation algorithms
D Marx - The Computer Journal, 2008 - ieeexplore.ieee.org
Approximation algorithms and parameterized complexity are usually considered to be two
separate ways of dealing with hard algorithmic problems. In this paper, our aim is to …
separate ways of dealing with hard algorithmic problems. In this paper, our aim is to …
Polylogarithmic inapproximability
We provide the first hardness result of a polylogarithmic approximation ratio for a natural NP-
hard optimization problem. We show that for every fixed ε> 0, the GROUP-STEINER-TREE …
hard optimization problem. We show that for every fixed ε> 0, the GROUP-STEINER-TREE …
Energy minimization via graph cuts: Settling what is possible
The recent explosion of interest in graph cut methods in computer vision naturally spawns
the question: what energy functions can be minimized via graph cuts? This question was first …
the question: what energy functions can be minimized via graph cuts? This question was first …
O (√ log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems
We give O (√ log n)-approximation algorithms for the MIN UNCUT, MIN 2CNF DELETION,
DIRECTED BALANCED SEPERATOR, and DIRECTED SPARSEST CUT problems. The …
DIRECTED BALANCED SEPERATOR, and DIRECTED SPARSEST CUT problems. The …