Sciweavers

7351 search results - page 1276 / 1471
» Segmenting Point Sets
Sort
View
ICSE
1999
IEEE-ACM
15 years 10 months ago
Dynamically Discovering Likely Program Invariants to Support Program Evolution
ÐExplicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are...
Michael D. Ernst, Jake Cockrell, William G. Griswo...
FOCS
1998
IEEE
15 years 10 months ago
The Finite Capacity Dial-A-Ride Problem
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
Moses Charikar, Balaji Raghavachari
ITC
1998
IEEE
114views Hardware» more  ITC 1998»
15 years 10 months ago
BETSY: synthesizing circuits for a specified BIST environment
This paper presents a logic synthesis tool called BETSY (BIST Environment Testable Synthesis) for synthesizing circuits that achieve complete (100%)fault coverage in a user specif...
Zhe Zhao, Bahram Pouya, Nur A. Touba
HT
1998
ACM
15 years 10 months ago
An Agenda for Open Hypermedia Research
The historical development of hypermedia systems can be rized as a series of successive abstractions of functionality away from the "core" hypermedia server, often resul...
Peter J. Nürnberg, John J. Leggett, Uffe Kock...
LCPC
1998
Springer
15 years 10 months ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...
« Prev « First page 1276 / 1471 Last » Next »