Sciweavers

535 search results - page 88 / 107
» Termination of Abstract Reduction Systems
Sort
View
ICDCS
1995
IEEE
14 years 1 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere
INFOCOM
2012
IEEE
12 years 14 days ago
RxIP: Monitoring the health of home wireless networks
Abstract—Deploying home access points (AP) is hard. Untrained users typically purchase, install, and configure a home AP with very little awareness of wireless signal coverage a...
Justin Manweiler, Peter Franklin, Romit Roy Choudh...
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
14 years 3 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
AIPS
2008
14 years 11 days ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
MMB
2010
Springer
185views Communications» more  MMB 2010»
14 years 20 hour ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker