242 search results - page 29 / 49 » Exploration of a Two Sided Rendezvous Search Problem Using G... |
EOR
2006
13 years 8 months ago
2006
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
CIBCB
2007
IEEE
14 years 14 days ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
AAAI
1998
13 years 9 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
IJON
2006
13 years 8 months ago
2006
This paper addresses the following question: ``What neural circuits can emulate the monosynaptic correlogram generated by a direct connection between two neurons?'' The ...
GECCO
2006
Springer
14 years 4 days ago
2006
Springer
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...