Sciweavers

7167 search results - page 1128 / 1434
» Answer Set Programming
Sort
View
ISSTA
2000
ACM
15 years 7 months ago
Testability, fault size and the domain-to-range ratio: An eternal triangle
A number of different concepts have been proposed that, loosely speaking, revolve around the notion of software testability. Indeed, the concept of testability itself has been int...
Martin R. Woodward, Zuhoor A. Al-Khanjari
111
Voted
MICRO
1999
IEEE
98views Hardware» more  MICRO 1999»
15 years 7 months ago
Access Region Locality for High-Bandwidth Processor Memory System Design
This paper studies an interesting yet less explored behavior of memory access instructions, called access region locality. Unlike the traditional temporal and spatial data localit...
Sangyeun Cho, Pen-Chung Yew, Gyungho Lee
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
15 years 7 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
15 years 6 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian
LCPC
2000
Springer
15 years 6 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
« Prev « First page 1128 / 1434 Last » Next »