Sciweavers

4224 search results - page 711 / 845
» Reasoning about Choice
Sort
View
NGC
1998
Springer
115views Communications» more  NGC 1998»
15 years 14 days ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
93
Voted
TC
1998
15 years 13 days ago
A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multihop Networks
—Many applications require communication services with guaranteed timeliness and fault tolerance at an acceptable level of overhead. We present a scheme for restoring real-time c...
Seungjae Han, Kang G. Shin
86
Voted
SIAMJO
2002
77views more  SIAMJO 2002»
15 years 13 days ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright
123
Voted
TITB
2002
142views more  TITB 2002»
15 years 13 days ago
Building a bioinformatics ontology using OIL
This paper describes the initial stages of building an ontology of bioinformatics and molecular biology. The conceptualisation is encoded using the Ontology Inference Layer (OIL),...
Robert Stevens, Carole A. Goble, Ian Horrocks, Sea...
103
Voted
TOPLAS
2002
98views more  TOPLAS 2002»
15 years 13 days ago
Data abstraction and information hiding
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
K. Rustan M. Leino, Greg Nelson