Sciweavers

3055 search results - page 348 / 611
» Randomized Search Trees
Sort
View
SAT
2004
Springer
131views Hardware» more  SAT 2004»
16 years 10 hour ago
A Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
Darsh P. Ranjan, Daijue Tang, Sharad Malik
GECCO
2006
Springer
187views Optimization» more  GECCO 2006»
15 years 10 months ago
The gregarious particle swarm optimizer (G-PSO)
This paper presents a gregarious particle swarm optimization algorithm (G-PSO) in which the particles explore the search space by aggressively scouting the local minima with the h...
Srinivas Pasupuleti, Roberto Battiti
UAI
2003
15 years 8 months ago
On Local Optima in Learning Bayesian Networks
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
Jens D. Nielsen, Tomás Kocka, José M...
MP
2006
137views more  MP 2006»
15 years 6 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
NPL
2000
95views more  NPL 2000»
15 years 6 months ago
Bayesian Sampling and Ensemble Learning in Generative Topographic Mapping
Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algo...
Akio Utsugi