Results 1  10
of
69
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
 ARTIF. INTELL
, 1992
"... This paper describes a simple heuristic approach to solving largescale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a valueorderin ..."
Abstract

Cited by 457 (6 self)
 Add to MetaCart
ordering heuristic, the minconflicts heuristic, that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the nqueens problem, a technique based on this approach performs orders
A Parallel Search Algorithm for the NQueens Problem
 IEEE Transactions on Systems, Man, and Cybernetics
, 1991
"... The Nqueens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the Nqueens problem. ..."
Abstract
 Add to MetaCart
The Nqueens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the Nqueens problem
A Parallel Search Algorithm for the NQueens Problem
 IEEE Transactions on Systems, Man, and Cybernetics
, 1991
"... The Nqueens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the Nqueens problem. Th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The Nqueens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the Nqueens problem
Particle Swarm Optimization For NQueens Problem
"... The NQueen is one of the prominent toy problems for performance assessment in the domain of Computational Intelligence. The problem greatly helps to examine the diverse aspects of solving techniques, counting the potential of obtaining feasible solution and computing time & space complexity. T ..."
Abstract
 Add to MetaCart
. The welldefined set of constraints sketches out all the versions of problem. The Queen has various attacking options over the chessboard. In point of fact, it can walk off across the column, row and both diagonals. The feasible solution of NQueens highly demands the nonattacking placements over
From ALife Agents to a Kingdom of N Queens
 In Jiming Liu and Ning Zhong (Eds.), Intelligent Agent Technology: Systems, Methodologies, and Tools
, 1999
"... This paper presents a new approach to solving Nqueen problems, which involves a model of distributed autonomous agents with artificial life (ALife) and a method of representing Nqueen constraints in an agent environment. The distributed agents locally interact with their living environment, i.e., ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper presents a new approach to solving Nqueen problems, which involves a model of distributed autonomous agents with artificial life (ALife) and a method of representing Nqueen constraints in an agent environment. The distributed agents locally interact with their living environment, i
Swarm Intelligence for Permutation Optimization: Case Study of nQueens Problem
, 2003
"... This paper introduces a modified Particle Swarm Optimizer which deals with permutation problems. Particles are defined as permutations of a group of unique values. Velocity updates are redefined based on the similarity of two particles. Particles change their permutations with a random rate defined ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
by their velocities. A mutation factor is introduced to prevent the current pBest from becoming stuck at local minima. Preliminary study on the nqueens problem shows that the modified PSO is promising in solving constraint satisfication problems.
Swarming the Kingdom: A New Multiagent Systems Approach to NQueens
"... This paper introduces Swarm Queens, a Swarm Intelligence approach to the NQueens problem. ERA is the current best Multiagent Systems solution to this classic Constraint Satisfaction Problem. Our algorithm improves upon ERA in terms of both time and space complexity. In addition, Swarm Queens has a ..."
Abstract
 Add to MetaCart
This paper introduces Swarm Queens, a Swarm Intelligence approach to the NQueens problem. ERA is the current best Multiagent Systems solution to this classic Constraint Satisfaction Problem. Our algorithm improves upon ERA in terms of both time and space complexity. In addition, Swarm Queens has a
Evaluation of Declarative NQueens Recursion: A Deductive Database Approach
"... Can we evaluate a logic program declaratively? That is, can a logic program be evaluated correctly and efficiently, independent of query modes and rule/predicate ordering, finding a complete set of answers, and terminating properly? The answer could be "yes", at least for a good subclass o ..."
Abstract
 Add to MetaCart
of logic programs, based on our investigation and experimentation using a deductive database approach. In this paper, an nqueens problem, a classical logic program, is used as a running example to demonstrate the methodology. Our analysis shows that binding analysis and constraint exploration are two
How should feasibility be handled by Genetic Algorithms on Constraint Combinatorial Optimization Problems? The case of the valued nqueens problem
, 2001
"... We show that a Genetic Algorithm based on the Baldwin effect successfully attacks Constraint Combinatorial Optimization Problems (CCOPs) for permutations. Deterministic mechanisms for efficient construction of feasible solutions form the basis of our approach. We illustrate our proposal with the val ..."
Abstract
 Add to MetaCart
with the valued nqueens problem, a typical CCOP. In this case, we obtain high quality solutions with execution times several orders of magnitude lower than the most recent previous approach.
Efficient Local Search with Conflict Minimization: A Case Study of the NQueens Problem
 IEEE Transactions on Knowledge and Data Engineering
, 1994
"... Backtracking search is frequently applied to solve a constraintbased search problem but it often suffers from exponential growth of computing time. We present an alternative to backtracking search: local search based on conflict minimization. We have applied this general search framework to study a ..."
Abstract

Cited by 31 (6 self)
 Add to MetaCart
a benchmark constraintbased search problem, the nqueens problem. An efficient local search algorithm for the nqueens problem was implemented. This algorithm, running in linear time, does not backtrack at all. It is capable of finding a solution for extremely large size nqueens problems
Results 1  10
of
69