Sciweavers

1071 search results - page 152 / 215
» Programming with enumerable sets of structures
Sort
View
VLDB
1987
ACM
93views Database» more  VLDB 1987»
15 years 2 months ago
FAD, a Powerful and Simple Database Language
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its p...
François Bancilhon, Ted Briggs, Setrag Khos...
SERVICES
2008
51views more  SERVICES 2008»
15 years 14 days ago
Iterative Workflows for Numerical Simulations in Subsurface Sciences
Numerical simulators are frequently used to assess future risks, support remediation and monitoring program decisions, and assist in design of specific remedial actions with respe...
Jared Chase, Karen Schuchardt, George Chin Jr., Je...
ACL
2001
15 years 13 days ago
Extending Lambek Grammars: a Logical Account of Minimalist Grammars
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...
Alain Lecomte, Christian Retoré
WSC
2001
15 years 12 days ago
Simulation and analysis of dealers' returns distribution strategy
Due to high demand uncertainty, excess inventory has been a key issue in inventory control. Caterpillar developed the dealers' parts inventory sharing (DPIS) and returns prog...
Hui Zhao
ISMB
1993
15 years 11 days ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic