16666 search results - page 101 / 3334 » Descriptive and Computational Complexity |
119
click to vote
SPDP
1990
IEEE
15 years 8 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...
129
click to vote
EWLR
1997
Springer
15 years 8 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...
113
click to vote
MASCOTS
2004
15 years 5 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 ...
121
Voted
NIPS
2001
15 years 5 months ago
2001
Mutual information is widely used, in a descriptive way, to measure the stochastic dependence of categorical random variables. In order to address questions such as the reliabilit...
139
click to vote
AII
1989
15 years 8 months ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...