Abstract Thesparsenessoftheencodingofstimulibysingle neurons and by populations of neurons is fundamental to understanding the efficiency and capacity of representations in the br...
Leonardo Franco, Edmund T. Rolls, Nikolaos C. Agge...
This work addresses the problem of finding the adjustable parameters of a learning algorithm using Genetic Algorithms. This problem is also known as the model selection problem. In...
In this work we address the issue of selecting and composing Web Services (WSs) considering functional requirements and transactional properties. We formalize the WS composition p...
Yudith Cardinale, Joyce El Haddad, Maude Manouvrie...
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
Environments in which Web service compositions (WSC) operate are often dynamic. We address the problem of which service to query for up-to-date information in order to adapt a hie...