Results 1  10
of
23,438
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
of Survival of the Fittest, in which some agents will die or be eaten if their moving strategies are less efficient than others. The experimental results have shown that this system is capable of solving largescale Nqueen problems. This paper also provides a model of ALife agents for solving general CSPs
SNOPT: An SQP Algorithm For LargeScale Constrained Optimization
, 2002
"... Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first deriv ..."
Abstract

Cited by 597 (24 self)
 Add to MetaCart
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first
Making LargeScale SVM Learning Practical
, 1998
"... Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large lea ..."
Abstract

Cited by 1861 (17 self)
 Add to MetaCart
and computational results developed for SV M light V2.0, which make largescale SVM training more practical. The results give guidelines for the application of SVMs to large domains.
Imagenet: A largescale hierarchical image database
 In CVPR
, 2009
"... The explosion of image data on the Internet has the potential to foster more sophisticated and robust models and algorithms to index, retrieve, organize and interact with images and multimedia data. But exactly how such data can be harnessed and organized remains a critical problem. We introduce her ..."
Abstract

Cited by 840 (28 self)
 Add to MetaCart
datasets. Constructing such a largescale database is a challenging task. We describe the data collection scheme with Amazon Mechanical Turk. Lastly, we illustrate the usefulness of ImageNet through three simple applications in object recognition, image classification and automatic object clustering. We
Pregel: A system for largescale graph processing
 IN SIGMOD
, 2010
"... Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational model ..."
Abstract

Cited by 496 (0 self)
 Add to MetaCart
Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational
Making LargeScale Support Vector Machine Learning Practical
, 1998
"... Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large lea ..."
Abstract

Cited by 628 (1 self)
 Add to MetaCart
algorithmic and computational results developed for SVM light V2.0, which make largescale SVM training more practical. The results give guidelines for the application of SVMs to large domains.
The anatomy of a largescale hypertextual web search engine.
 Comput. Netw. ISDN Syst.,
, 1998
"... Abstract In this paper, we present Google, a prototype of a largescale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a fu ..."
Abstract

Cited by 4673 (5 self)
 Add to MetaCart
an indepth description of our largescale web search engine the first such detailed public description we know of to date. Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information
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
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 value
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
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 algorithm finds a solution by performing a probabilistic parallel search. By using n processors, its running time is O(log 2 n). The algorithm demonstrates a new practical approach to tackle large scale CSP on parallel computers. 1 Introduction The Nqueens problem is to place n queens on an n \Theta n
Results 1  10
of
23,438