Sciweavers

805 search results - page 40 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
CP
2006
Springer
14 years 7 days ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
AI
2005
Springer
13 years 8 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
COMAD
2009
13 years 9 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
LCPC
2000
Springer
14 years 2 days ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
CPAIOR
2006
Springer
14 years 7 days ago
A Hybrid Column Generation and Constraint Programming Optimizer for the Tail Assignment Problem
Tail Assignment is the problem of assigning flight legs to aircraft while satisfying all operational constraints, and optimizing some objective function. In this article, we presen...
Sami Gabteni, Mattias Grönkvist