Sciweavers

3454 search results - page 250 / 691
» Modern computer algebra
Sort
View
ICALP
2004
Springer
16 years 5 hour ago
Extensional Theories and Rewriting
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...
Grigore Rosu
ICALP
2003
Springer
15 years 12 months ago
Bisimulation Proof Methods for Mobile Ambients
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
Massimo Merro, Francesco Zappa Nardelli
DAGSTUHL
2007
15 years 8 months ago
Model equivalence of PRISM programs
The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from a...
James Cussens
NETWORKING
2000
15 years 8 months ago
An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership
In this paper we present an algorithm to construct low-cost source trees for multicast with multiple QoS constraints and dynamic membership. Assuming the availability of link-state...
Aiguo Fei, Mario Gerla
IJCAI
1989
15 years 7 months ago
Visual Reasoning in Geometry Theorem Proving
We study the role of visual reasoning as a computationally feasible heuristic tool in geometry problem solving. We use an algebraic notation to represent geometric objects and to ...
Michelle Y. Kim