1351 search results - page 162 / 271 » An Analysis of Inference with the Universum |
ICNP
2003
IEEE
15 years 3 months ago
2003
IEEE
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as ¢¤£¦¥¨§© , which is prohibitive i...
106
click to vote
IEEEAMS
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper demonstrates that the dependability of generic, evolving J2EE applications can be enhanced through a combination of a few recovery-oriented techniques. Our goal is to r...
WCRE
2000
IEEE
15 years 2 months ago
2000
IEEE
We show how hypertext-based program understanding tools eve new levels of abstraction by using inferred type information for cases where the subject software system is written in ...
TACS
1997
Springer
15 years 2 months ago
1997
Springer
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
RTA
1993
Springer
15 years 2 months ago
1993
Springer
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...