Sciweavers

4595 search results - page 786 / 919
» Reasoning about Plans
Sort
View
NGC
1998
Springer
115views Communications» more  NGC 1998»
13 years 8 months 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
TC
1998
13 years 8 months 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
SIAMJO
2002
77views more  SIAMJO 2002»
13 years 8 months 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
TOPLAS
2002
98views more  TOPLAS 2002»
13 years 8 months 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
TOSEM
2002
153views more  TOSEM 2002»
13 years 8 months ago
Automated abstraction of class diagrams
d Abstraction of Class Diagrams ALEXANDER EGYED Teknowledge Corporation Designers can easily become overwhelmed with details when dealing with large class diagrams. icle presents a...
Alexander Egyed