2206 search results - page 199 / 442 » On the power of coercion abstraction |
173
click to vote
SARA
2007
Springer
16 years 21 days ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
144
click to vote
SCALESPACE
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Based on a new, general formulation of the geometric method of moving frames, invariantization of numerical schemes has been established during the last years as a powerf...
155
click to vote
SSS
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. We study the problem of global predicate detection in presence of permanent and transient failures. We term the transient failures as small faults. We show that it is imp...
148
click to vote
TAMC
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
185
click to vote
VMCAI
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...