Sciweavers

504 search results - page 30 / 101
» Definitional Reflection and the Completion
Sort
View
VLDB
1992
ACM
112views Database» more  VLDB 1992»
14 years 23 days ago
Incomplete Information in Relational Temporal Databases
For the conventional relational model there has been considerable research in the area of incomplete information. On the other hand, research in temporal databases has concentrated...
Shashi K. Gadia, Sunil S. Nair, Yiu-Cheong Poon
ESM
2000
13 years 10 months ago
SEP: Simulation framework to evaluate digital hardware architectures
Know-how is the most useful mean for designing new processors before a complete hardware description. The integration rate is increasing very quickly and the timeto-market has to ...
Frédéric Mallet, Fernand Boér...
IJCAI
1989
13 years 10 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 8 months ago
Specifying Reusable Components
Reusable software components need well-defined interfaces, rigorously and completely documented features, and a design amenable both to reuse and to formal verification; all these...
Nadia Polikarpova, Carlo A. Furia, Bertrand Meyer
CC
2006
Springer
133views System Software» more  CC 2006»
13 years 8 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx