Sciweavers

10271 search results - page 1707 / 2055
» Computational science
Sort
View
LICS
2005
IEEE
16 years 11 days ago
Proof-Theoretic Approach to Description-Logic
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
Martin Hofmann
174
Voted
LICS
2005
IEEE
16 years 11 days ago
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
Jérôme Leroux
ITICSE
2005
ACM
16 years 10 days ago
A prolog toolkit for formal languages and automata
This paper describes the first version of P (read “P flat”), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms t...
Michel Wermelinger, Artur Miguel Dias
ITICSE
2005
ACM
16 years 10 days ago
Implications of perspective in teaching objects first and object design
There are an increasing number of books published on the important topics of “object-oriented programming” and “object-oriented design” for use in education. However, obje...
Henrik Bærbak Christensen
MSWIM
2005
ACM
16 years 10 days ago
YAES: a modular simulator for mobile networks
Developing network protocols for mobile wireless systems is a complex task, and most of the existing simulator frameworks are not well suited for experimental development. The YAE...
Ladislau Bölöni, Damla Turgut
« Prev « First page 1707 / 2055 Last » Next »