Sciweavers

1076 search results - page 193 / 216
» Graphs in molecular biology
Sort
View
COMPLEX
2009
Springer
15 years 3 months ago
A Comparative Analysis of Specific Spatial Network Topological Models
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
Jun Wang, Gregory M. Provan
SPDP
1991
IEEE
15 years 3 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
MCU
2004
129views Hardware» more  MCU 2004»
15 years 1 months ago
Solving 3CNF-SAT and HPP in Linear Time Using WWW
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
Florin Manea, Carlos Martín-Vide, Victor Mi...
CONNECTION
2006
101views more  CONNECTION 2006»
14 years 12 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
JMLR
2010
139views more  JMLR 2010»
14 years 6 months ago
Causal learning without DAGs
Causal learning methods are often evaluated in terms of their ability to discover a true underlying directed acyclic graph (DAG) structure. However, in general the true structure ...
David Duvenaud, Daniel Eaton, Kevin P. Murphy, Mar...