Results 1  10
of
8,988
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
.e., a chessboard, and execute their reactive behaviors by applying their behavioral rules for randomized motion, leastconflict position searching, and cooperating with other agents etc. The agentbased Nqueen problem solving system evolves through selection and contest according to the rule
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 730 (21 self)
 Add to MetaCart
approaches such as the DavisPutnam procedure or resolution. We also show that GSAT can solve structured satisfiability problems quickly. In particular, we solve encodings of graph coloring problems, Nqueens, and Boolean induction. General application strategies and limitations of the approach are also
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
Consensus and cooperation in networked multiagent systems
 Proceedings of the IEEE
, 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees. An ove ..."
Abstract

Cited by 807 (4 self)
 Add to MetaCart
. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems
The nqueens problem
 American Mathematical Monthly
, 1994
"... which Archimedes devised in epigrams, and which he communicated to students of such matters ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
which Archimedes devised in epigrams, and which he communicated to students of such matters
A Hybrıd Partıcle Swarm Genetıc Algorıthm (Psoga) For NQueen Problem
"... Evolutionary algorithms have proven to be robust tools in data processing for modeling dynamic, nonlinear and complex processes due to their flexible mathematical structure to yield optimal results even with imprecise, ambiguity and noise at its input. The study is a softcomputing heuristicbased, ..."
Abstract
 Add to MetaCart
Evolutionary algorithms have proven to be robust tools in data processing for modeling dynamic, nonlinear and complex processes due to their flexible mathematical structure to yield optimal results even with imprecise, ambiguity and noise at its input. The study is a softcomputing heuristicbased
LETAVEC AND RUGGIERO The nQueens Problem The nQueens Problem
"... The nqueens problem, originally introduced in 1850 by Carl Gauss, may be stated as follows: find a placement of n queens on an n×n chessboard, such that no one queen can be taken by any other. While it has been well known that the solution to the nqueens problem is n, numerous solutions have been ..."
Abstract
 Add to MetaCart
The nqueens problem, originally introduced in 1850 by Carl Gauss, may be stated as follows: find a placement of n queens on an n×n chessboard, such that no one queen can be taken by any other. While it has been well known that the solution to the nqueens problem is n, numerous solutions have been
Agents that reason and negotiate by arguing
 Journal of Logic and Computation
, 1998
"... The need for negotiation in multiagent systems stems from the requirement for agents to solve the problems posed by their interdependence upon one another. Negotiation provides a solution to these problems by giving the agents the means to resolve their conflicting objectives, correct inconsistenci ..."
Abstract

Cited by 381 (77 self)
 Add to MetaCart
inconsistencies in their knowledge of other agents ' world views, and coordinate a joint approach to domain tasks which benefits all the agents concerned. We propose a framework, based upon a system of argumentation, which permits agents to negotiate in order to establish acceptable ways of solving problems
Quantum Algorithm for NQueens problem
"... We study the application of quantum computing to the Queens problem. The presented quantum algorithm for this combinatorial search problem allows significant reduction of number of iteration. 1 ..."
Abstract
 Add to MetaCart
We study the application of quantum computing to the Queens problem. The presented quantum algorithm for this combinatorial search problem allows significant reduction of number of iteration. 1
Solving NQueen Problem by Prediction
"... Abstract – The classic problems lead the researchers to innovate general solutions for similar class of problems. One of the wellknown problems and its solution are the 8Queen puzzle and back tracking. At many cases back tracking may consider as brute force, but it is not true. It is not necessary ..."
Abstract
 Add to MetaCart
Abstract – The classic problems lead the researchers to innovate general solutions for similar class of problems. One of the wellknown problems and its solution are the 8Queen puzzle and back tracking. At many cases back tracking may consider as brute force, but it is not true
Results 1  10
of
8,988