Sciweavers

1041 search results - page 73 / 209
» Randomizing Reductions of Search Problems
Sort
View
GECCO
2003
Springer
268views Optimization» more  GECCO 2003»
14 years 1 months ago
A Generalized Feedforward Neural Network Architecture and Its Training Using Two Stochastic Search Methods
Shunting Inhibitory Artificial Neural Networks (SIANNs) are biologically inspired networks in which the synaptic interactions are mediated via a nonlinear mechanism called shuntin...
Abdesselam Bouzerdoum, Rainer Mueller
ECAI
2008
Springer
13 years 9 months ago
Justification-Based Non-Clausal Local Search for SAT
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
FLAIRS
2004
13 years 9 months ago
A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Debasis Mitra, Hyoung-rae Kim
UC
2005
Springer
14 years 1 months ago
Quantum Searching Amidst Uncertainty
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
Lov K. Grover
ICML
2001
IEEE
14 years 8 months ago
Direct Policy Search using Paired Statistical Tests
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
Malcolm J. A. Strens, Andrew W. Moore