Sciweavers

287 search results - page 3 / 58
» UDS: A Universal Data Structure
Sort
View
VLDB
1999
ACM
89views Database» more  VLDB 1999»
13 years 10 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
EH
2004
IEEE
98views Hardware» more  EH 2004»
13 years 9 months ago
Self-Replication of 3D Universal Structures
After a survey of some realizations of self-replicating machines, this paper presents the construction based selfreplication of universal 3D structures. This self-replication proc...
André Stauffer, Daniel Mange, Enrico Petrag...
TSMC
2011
324views more  TSMC 2011»
13 years 21 days ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 8 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
SOFSEM
2009
Springer
14 years 2 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach