Sciweavers

15073 search results - page 401 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
ICLP
1999
Springer
15 years 11 months ago
Computing Large and Small Stable Models
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
Miroslaw Truszczynski
184
Voted
CG
2006
Springer
15 years 10 months ago
Monte-Carlo Proof-Number Search for Computer Go
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...
Jahn-Takeshi Saito, Guillaume Chaslot, Jos W. H. M...
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 10 months ago
A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...
Christian Igel, Thorsten Suttorp, Nikolaus Hansen
AAAI
2010
15 years 8 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
GROUP
2010
ACM
15 years 4 months ago
The human factors of consistency maintenance in multiplayer computer games
Consistency maintenance (CM) techniques are a crucial part of many distributed systems, and are particularly important in networked games. In this paper we describe a framework of...
Cheryl Savery, T. C. Nicholas Graham, Carl Gutwin