13603 search results - page 32 / 2721 » On the computational complexity of bridgecard |
194
click to vote
EWLR
1997
Springer
15 years 11 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...
170
click to vote
MASCOTS
2004
15 years 8 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 ...
168
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....
188
click to vote
AII
1989
15 years 11 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...
183
click to vote
CADE
2008
Springer
15 years 8 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...