10271 search results - page 607 / 2055 » Computer Science |
229
click to vote
RTA
1991
Springer
15 years 10 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
212
click to vote
STACS
1991
Springer
15 years 10 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
182
click to vote
ACMSE
2008
ACM
15 years 9 months ago
2008
ACM
Numerical solution of any large, three-dimensional fluid flow problem is a computationally intensive task that typically requires supercomputer solution to achieve reasonable exec...
162
click to vote
CSR
2008
Springer
15 years 9 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
171
click to vote
IADIS
2004
15 years 8 months ago
2004
This paper is a report of some of the findings in a study of how and what women in computer science learn using the Internet for communication with other women. The focus of this ...