Sciweavers

272 search results - page 36 / 55
» Programming languages capturing complexity classes
Sort
View
MODELS
2009
Springer
14 years 3 months ago
Teaching Modeling: Why, When, What?
This paper reports on a panel discussion held during the Educators’ Symposium at MODELS’2009. It shortly explains the context provided for the discussion and outlines the state...
Jean Bézivin, Robert France, Martin Gogolla...
FOCS
1998
IEEE
14 years 3 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
SODA
2003
ACM
142views Algorithms» more  SODA 2003»
14 years 6 days ago
The similarity metric
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...
LFCS
2007
Springer
14 years 5 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
CP
2007
Springer
14 years 5 months ago
Strong Controllability of Disjunctive Temporal Problems with Uncertainty
The Disjunctive Temporal Problem with Uncertainty (DTPU) is an extension of the Disjunctive Temporal Problem (DTP) that accounts for events not under the control of the executing a...
Bart Peintner, Kristen Brent Venable, Neil Yorke-S...