Sciweavers

272 search results - page 44 / 55
» Programming languages capturing complexity classes
Sort
View
ICALP
2005
Springer
14 years 28 days ago
Recursive Markov Decision Processes and Recursive Stochastic Games
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
Kousha Etessami, Mihalis Yannakakis
CP
2005
Springer
14 years 29 days ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...
EMSOFT
2004
Springer
14 years 24 days ago
Reactive process networks
Data flow process networks are a good model of computation for streaming multimedia applications incorporating audio, video and/or graphics streams. Process networks are concurre...
Marc Geilen, Twan Basten
CD
2005
Springer
14 years 29 days ago
A Decentralized Redeployment Algorithm for Improving the Availability of Distributed Systems
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
Sam Malek, Marija Mikic-Rakic, Nenad Medvidovic
ICALP
2011
Springer
12 years 11 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner