2715 search results - page 515 / 543 » An Implementation of Narrowing Strategies |
HYBRID
1998
Springer
13 years 11 months ago
1998
Springer
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
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...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
ASPLOS
1994
ACM
13 years 11 months ago
1994
ACM
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...