Sciweavers

61 search results - page 1 / 13
» Descriptional Complexity of Machines with Limited Resources
Sort
View
JUCS
2002
101views more  JUCS 2002»
13 years 4 months ago
Descriptional Complexity of Machines with Limited Resources
: Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of diff...
Jonathan Goldstine, Martin Kappes, Chandra M. R. K...
JIT
2005
Springer
149views Database» more  JIT 2005»
13 years 10 months ago
Grid Resource Ontologies and Asymmetric Resource-Correlation
Automatic Grid resource discovery and brokerage shields the Grid middleware complexities from the Grid users and leads towards an invisible but simple and robust Grid. Realizing th...
Mumtaz Siddiqui, Thomas Fahringer, Jürgen Hof...
TITB
2002
98views more  TITB 2002»
13 years 4 months ago
OILing the way to machine understandable bioinformatics resources
The complex questions and analyses posed by biologists, as well as the diverse data resources they develop, require the fusion of evidence from different, independently developed ...
Robert Stevens, Carole A. Goble, Ian Horrocks, Sea...
CADE
1998
Springer
13 years 9 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...
JSA
2002
130views more  JSA 2002»
13 years 4 months ago
Reconfigurable models of finite state machines and their implementation in FPGAs
This paper examines some models of FSMs that can be implemented in dynamically and statically reconfigurable FPGAs. They enable circuits for the FSMs to be constructed in such a wa...
Valery Sklyarov