Sciweavers

17789 search results - page 3468 / 3558
» Exceptional Use Cases
Sort
View
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 11 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...
AAAI
2010
13 years 11 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
13 years 11 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
APVIS
2010
13 years 11 months ago
Visualizing field-measured seismic data
This paper presents visualization of field-measured, time-varying multidimensional earthquake accelerograph readings. Direct volume rendering is used to depict the space-time rela...
Tung-Ju Hsieh, Cheng-Kai Chen, Kwan-Liu Ma
CCCG
2010
13 years 11 months ago
Multi-guard covers for polygonal regions
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
Zohreh Jabbari, William S. Evans, David G. Kirkpat...
« Prev « First page 3468 / 3558 Last » Next »