The goal of this chapter, which is based on reference [63], is to better characterize the nature of the search space of particular problems where the number of optimal solutions, and the difficulty of finding them, varies as a function of a parameter that can be modified at will. According to the value of the parameter, the system goes from a situation in which there are many solutions to the problem to a situation in which, suddenly, there are no solutions at all. This type of behavior is typical of phase transitions in physics and the term has been adopted in the computational field by analogy with the physical world
We outline a technique for studying phase transition behaviour in computational problems using numbe...
We identify a natural parameter for random number partitioning, and show that there is a rapid trans...
. Phase transitions in constraint satisfaction problems (CSP's) are the subject of intense stud...
A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimizat...
AbstractMany recent studies have identified phase transitions from under- to overconstrained instanc...
AbstractRecently, it has been recognized that phase transitions play an important role in the probab...
AbstractWe describe how techniques that were originally developed in statistical mechanics can be ap...
AbstractThe phase transition in binary constraint satisfaction problems, i.e. the transition from a ...
The authors explore a new general-purpose heuristic for finding high-quality solutions to hard optim...
Phase transitions, ubiquitous in condensedmatter physics, are encounteredin computer science too. Th...
We report an analytic and numerical study of a phase transition in a P problem (the assignment pro...
Phase transitions in the solubility of problem instances are known in many types of computational pr...
Phase transitions play an important role in understanding search difficulty in combinatorial optimis...
AbstractIn recent years, numerous studies have observed that many hard combinatorial decision proble...
We introduce a parameter that measures the 'constrainedness' of an ensemble of combinatorial problem...
We outline a technique for studying phase transition behaviour in computational problems using numbe...
We identify a natural parameter for random number partitioning, and show that there is a rapid trans...
. Phase transitions in constraint satisfaction problems (CSP's) are the subject of intense stud...
A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimizat...
AbstractMany recent studies have identified phase transitions from under- to overconstrained instanc...
AbstractRecently, it has been recognized that phase transitions play an important role in the probab...
AbstractWe describe how techniques that were originally developed in statistical mechanics can be ap...
AbstractThe phase transition in binary constraint satisfaction problems, i.e. the transition from a ...
The authors explore a new general-purpose heuristic for finding high-quality solutions to hard optim...
Phase transitions, ubiquitous in condensedmatter physics, are encounteredin computer science too. Th...
We report an analytic and numerical study of a phase transition in a P problem (the assignment pro...
Phase transitions in the solubility of problem instances are known in many types of computational pr...
Phase transitions play an important role in understanding search difficulty in combinatorial optimis...
AbstractIn recent years, numerous studies have observed that many hard combinatorial decision proble...
We introduce a parameter that measures the 'constrainedness' of an ensemble of combinatorial problem...
We outline a technique for studying phase transition behaviour in computational problems using numbe...
We identify a natural parameter for random number partitioning, and show that there is a rapid trans...
. Phase transitions in constraint satisfaction problems (CSP's) are the subject of intense stud...