Sciweavers

95 search results - page 13 / 19
» Modal Logics for Metric Spaces: Open Problems
Sort
View
DSS
2002
231views more  DSS 2002»
13 years 7 months ago
Computational aspects of the FLBC framework
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...
Aspassia Daskalopulu, Marek J. Sergot
FORMATS
2006
Springer
13 years 11 months ago
Temporal Logic Verification Using Simulation
In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the...
Georgios E. Fainekos, Antoine Girard, George J. Pa...
ECCC
2010
92views more  ECCC 2010»
13 years 6 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
13 years 9 months ago
A plant location guide for the unsure
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
AGENTCL
2000
Springer
13 years 11 months ago
Dialogue in Team Formation
The process of cooperative problem solving can be divided into four stages. First, finding potential team members, then forming a team followed by constructing a plan for that tea...
Frank Dignum, Barbara Dunin-Keplicz, Rineke Verbru...