28888 search results - page 122 / 5778 » Computability and complexity in analysis |
188
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: Since its inception, proteomics has essentially operated in a discovery mode with the goal of identifying and quantifying the maximal number of proteins in a sample. I...
140
click to vote
SPDP
1990
IEEE
15 years 10 months ago
1990
IEEE
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
169
click to vote
EWLR
1997
Springer
15 years 10 months ago
1997
Springer
Building robots can be a tough job because the designer has to predict the interactions between the robot and the environment as well as to deal with them. One solution to cope the...
157
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....