2703 search results - page 399 / 541 » Optimizing memory transactions |
142
click to vote
SAGA
2001
Springer
15 years 8 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
118
Voted
ICPR
2000
IEEE
15 years 8 months ago
2000
IEEE
In the recent years support vector machines (SVMs) have been successfully applied to solve a large number of classification problems. Training an SVM, usually posed as a quadrati...
116
Voted
ISSTA
2000
ACM
15 years 7 months ago
2000
ACM
This paper presents a strategy for structural testing of objectoriented software systems with possibly unknown clients and unknown information about invoked methods. By exploiting...
126
Voted
EUROPAR
1999
Springer
15 years 7 months ago
1999
Springer
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Du...
133
click to vote
ICS
1999
Tsinghua U.
15 years 7 months ago
1999
Tsinghua U.
A cache line size has a signi cant e ect on missrate and memorytra c. Today's computers use a xed line size, typically 32B, which may not be optimalfor a given application. O...