Sciweavers

4066 search results - page 63 / 814
» Almost Complete Sets
Sort
View
JSYML
2008
74views more  JSYML 2008»
13 years 10 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
ISJ
1998
82views more  ISJ 1998»
13 years 9 months ago
Successfully completing case study research: combining rigour, relevance and pragmatism
The organizational and social issues associated with the development, implementation and use of computer-based information systems have increasingly attracted the attention of info...
Peta Darke, Graeme G. Shanks, Marianne Broadbent
TKDE
2010
168views more  TKDE 2010»
13 years 8 months ago
Completely Lazy Learning
—Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not complet...
Eric K. Garcia, Sergey Feldman, Maya R. Gupta, San...
CATS
2006
13 years 11 months ago
On the Logical Implication of Multivalued Dependencies with Null Values
The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe (Fagin 1977, Zaniolo 1976). Whi...
Sebastian Link
IOR
2002
135views more  IOR 2002»
13 years 9 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss