Sciweavers

1126 search results - page 44 / 226
» Modularity and the Rule of Adaptation
Sort
View
RTA
1991
Springer
15 years 2 months ago
Completeness of Combinations of Constructor Systems
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
Aart Middeldorp, Yoshihito Toyama
CORR
2010
Springer
129views Education» more  CORR 2010»
14 years 10 months ago
sTeXIDE: An Integrated Development Environment for sTeX Collections
Authoring documents in MKM formats like OMDoc is a very tedious task. After years of working on a semantically annotated corpus of STEX documents (GenCS), we identified a set of co...
Constantin Jucovschi, Michael Kohlhase
MP
2006
123views more  MP 2006»
14 years 11 months ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...
WIA
2000
Springer
15 years 2 months ago
Solving Complex Problems Efficiently with Adaptive Automata
- Adaptive technologies are based on the self-modifying property of some systems, which give their users a very powerful and convenient facility for expressing and handling complex...
João José Neto
AI
2009
Springer
15 years 3 months ago
Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
Rahmatullah Hafiz