Sciweavers

4940 search results - page 911 / 988
» On the Complexity of Universal Programs
Sort
View
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 9 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
CG
2000
Springer
13 years 9 months ago
Sketching space
In this paper we present a sketch modelling system which we call Stilton. The program resembles a desktop VRML browser, allowing a user to navigate a 3D model in a perspective pro...
Alasdair Turner, David Chapman, Alan Penn
CN
2000
128views more  CN 2000»
13 years 9 months ago
The Network Workbench: network simulation software for academic investigation of Internet concepts
Simulation offers significant advantages as a basis for academic projects in computer networking. many unimportant details can be abstracted away, and also because simulations can...
J. Mark Pullen
INTERNET
2002
145views more  INTERNET 2002»
13 years 9 months ago
Where is Middleware?
stract level, remote procedure calls enable programmers to invoke (possibly remote) services as if they were intra-application procedure calls. Much like function or procedure call...
Steve Vinoski
SCFBM
2008
104views more  SCFBM 2008»
13 years 9 months ago
A Perl toolkit for LIMS development
Background: High throughput laboratory techniques generate huge quantities of scientific data. Laboratory Information Management Systems (LIMS) are a necessary requirement, dealin...
James A. Morris, Simon A. Gayther, Ian J. Jacobs, ...