4074 search results - page 577 / 815 » Defining Computational Aesthetics |
172
click to vote
ICDE
1993
IEEE
15 years 10 months ago
1993
IEEE
To add time su port to the relational model, both first normal form (fNF and non-INF appmches have maining within 1NF when time support is added may introduce data redundancy. The...
178
click to vote
POPL
1992
ACM
15 years 10 months ago
1992
ACM
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
179
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
169
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Since testing is inherently incomplete, test selection is of vital importance. Coverage measures evaluate the quality of a test suite and help the tester select test case...
173
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...