13603 search results - page 66 / 2721 » On the Complexity of Computing Treelength |
ICS
2010
Tsinghua U.
14 years 2 months ago
2010
Tsinghua U.
SPDP
1990
IEEE
14 years 1 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...
EWLR
1997
Springer
14 years 1 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...
MASCOTS
2004
13 years 10 months ago
2004
Queueing models are routinely used to analyze the performance of software systems. However, contrary to common assumptions, the time that a software server takes to complete jobs ...
CORR
2007
Springer
13 years 9 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....