Sciweavers

4438 search results - page 475 / 888
» The Case for Collaborative Programming
Sort
View
CORR
2004
Springer
85views Education» more  CORR 2004»
15 years 6 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
IEEECIT
2010
IEEE
15 years 5 months ago
Non-recursive Algorithm of Tower of Hanoi Problem
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan
CBRMD
2010
40views more  CBRMD 2010»
15 years 5 months ago
Adaptation Problems focusing on Endocrine Therapy Support
So far, Case-Based Reasoning has not become as successful in medicine as in some other application domains. One, probably the main reason is the adaptation problem. In Case-Based R...
Rainer Schmidt, Olga Vorobieva
FUIN
2010
106views more  FUIN 2010»
15 years 4 months ago
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
Linh Anh Nguyen
SIAMDM
2011
15 years 1 months ago
On Maximal S-Free Convex Sets
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
Diego A. Morán R., Santanu S. Dey