Sciweavers

264 search results - page 31 / 53
» On the possibility of faster SAT algorithms
Sort
View
CEC
2008
IEEE
15 years 4 days ago
Investigation of simply coded evolutionary artificial neural networks on robot control problems
One of the advantages of evolutionary robotics over other approaches in embodied cognitive science would be its parallel population search. Due to the population search, it takes a...
Yoshiaki Katada, Jun Nakazawa
ICANN
2007
Springer
14 years 12 months ago
Solving Selected Classification Problems in Bioinformatics Using Multilayer Neural Network Based on Multi-Valued Neurons (MLMVN)
A multilayer neural network based on multi-valued neurons (MLMVN) is a new powerful tool for solving classification, recognition and prediction problems. This network has a number ...
Igor N. Aizenberg, Jacek M. Zurada
IPCO
2008
221views Optimization» more  IPCO 2008»
14 years 11 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
81
Voted
ACL
2010
14 years 8 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
ICASSP
2011
IEEE
14 years 1 months ago
Fourier expansion of hammerstein models for nonlinear acoustic system identification
We consider the task of acoustic system identification, where the input signal undergoes a memoryless nonlinear transformation before convolving with an unknown linear system. We...
Sarmad Malik, Gerald Enzner