Sciweavers

314 search results - page 24 / 63
» Complete Problems for Dynamic Complexity Classes
Sort
View
CSL
2008
Springer
14 years 11 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
EDBT
2004
ACM
155views Database» more  EDBT 2004»
15 years 9 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
CDC
2009
IEEE
160views Control Systems» more  CDC 2009»
15 years 2 months ago
Receding horizon temporal logic planning for dynamical systems
— This paper bridges the advances in computer science and control to allow automatic synthesis of control strategies for complex dynamical systems which are guaranteed, by constr...
Tichakorn Wongpiromsarn, Ufuk Topcu, R. Richard Mu...
CASCON
2006
119views Education» more  CASCON 2006»
14 years 11 months ago
Static analysis for dynamic coupling measures
Coupling measures have important applications in software development and maintenance. They are used to reason about the structural complexity of software and have been shown to p...
Yin Liu, Ana Milanova
78
Voted
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
14 years 1 months ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya