Sciweavers

2850 search results - page 563 / 570
» On Timed Models and Full Abstraction
Sort
View
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 1 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
15 years 1 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
ICDCS
1995
IEEE
15 years 1 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere
CP
2009
Springer
15 years 25 days ago
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...
80
Voted
ASWC
2008
Springer
14 years 11 months ago
ROC: A Method for Proto-ontology Construction by Domain Experts
Abstract. Ontology construction is a labour-intensive and costly process. Even though many formal and semi-formal vocabularies are available, creating an ontology for a specific ap...
Nicole J. J. P. Koenderink, Mark van Assem, J. Lar...