Sciweavers

87 search results - page 17 / 18
» Approximate Qualitative Temporal Reasoning
Sort
View
AAAI
1992
13 years 9 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
IMC
2010
ACM
13 years 6 months ago
On economic heavy hitters: shapley value analysis of 95th-percentile pricing
Cost control for the Internet access providers (AP) influences not only the nominal speeds offered to the customers, but also other, more controversial, policies related to traffi...
Rade Stanojevic, Nikolaos Laoutaris, Pablo Rodrigu...
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
14 years 2 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
AB
2007
Springer
14 years 2 months ago
Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks
A series of papers, all under the title of Algorithmic Algebraic Model Checking (AAMC), has sought to combine techniques from algorithmic algebra, model checking and dynamical syst...
Venkatesh Mysore, Bud Mishra
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 8 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray