Sciweavers

17505 search results - page 3410 / 3501
» Use Cases as Workflows
Sort
View
156
Voted
FASE
2008
Springer
15 years 6 months ago
A Formal Framework for Developing Adaptable Service-Based Applications
Web services are open, interoperable, easy to integrate and reuse, and are extensively used in many application domains. Research and best practices have produced excellent support...
Leen Lambers, Leonardo Mariani, Hartmut Ehrig, Mau...
FOSSACS
2008
Springer
15 years 5 months ago
Footprints in Local Reasoning
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
Mohammad Raza, Philippa Gardner
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
15 years 5 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
145
Voted
AAAI
2010
15 years 5 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
AIML
2008
15 years 5 months ago
Valentini's cut-elimination for provability logic resolved
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
Rajeev Goré, Revantha Ramanayake
« Prev « First page 3410 / 3501 Last » Next »