Sciweavers

1788 search results - page 125 / 358
» Model Theory for Process Algebra
Sort
View
EC
1998
112views ECommerce» more  EC 1998»
15 years 14 days ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
HICSS
2000
IEEE
129views Biometrics» more  HICSS 2000»
15 years 5 months ago
Understanding the Plant Level Costs and Benefits of ERP: Will the Ugly Duckling Always Turn into a Swan?
This paper explores the impact of Enterprise Resource Planning (ERP) systems using the individual manufacturing facility as the level of analysis. A model of ERP costs and benefit...
Thomas F. Gattiker, Dale Goodhue
106
Voted
JLP
2007
114views more  JLP 2007»
15 years 21 days ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
VLDB
1994
ACM
128views Database» more  VLDB 1994»
15 years 4 months ago
From Nested-Loop to Join Queries in OODB
Most declarative SQL-like query languagesfor object-oriented database systems (OOSQL) are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-,...
Hennie J. Steenhagen, Peter M. G. Apers, Henk M. B...
116
Voted
IANDC
2010
132views more  IANDC 2010»
14 years 10 months ago
The expressive power of the shuffle product
There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious opera...
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Er...