724 search results - page 25 / 145 » Some Structural Complexity Aspects of Neural Computation |
ESAW
2009
Springer
13 years 5 months ago
2009
Springer
009), which constitutes an abstraction of the various aspects of a MAS, generalizing the AGR approach and incorporating the institutional work of Searle (Searle 1995). This model i...
DAC
2009
ACM
14 years 8 months ago
2009
ACM
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
BMCBI
2008
13 years 7 months ago
2008
Background: Structure-based computational methods are needed to help identify and characterize protein-protein complexes and their function. For individual proteins, the most succ...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...