26496 search results - page 380 / 5300 » An Approach to Computing Ethics |
151
click to vote
APL
1998
ACM
15 years 11 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
153
click to vote
IEAAIE
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. This paper has as main goal to develop a hybrid expert system to minimize some of the complexity problems related to arti cial intelligence eld. For instance, we can ment...
235
click to vote
ALP
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
161
click to vote
ISSS
1996
IEEE
15 years 11 months ago
1996
IEEE
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
201
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Most classification methods assume that the samples are drawn independently and identically from an unknown data generating distribution, yet this assumption is violated ...