Sciweavers

2005 search results - page 363 / 401
» Decisive Markov Chains
Sort
View
AMAI
2005
Springer
14 years 11 months ago
Resolution cannot polynomially simulate compressed-BFS
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov
TWC
2008
114views more  TWC 2008»
14 years 11 months ago
Two dimensional cross-layer optimization for packet transmission over fading channel
In this paper a single-input-single-output wireless data transmission system with adaptive modulation and coding over correlated fading channel is considered, where run-time power ...
Xiaofeng Bai, Abdallah Shami
CJ
2004
141views more  CJ 2004»
14 years 11 months ago
Modeling and Analysis of a Scheduled Maintenance System: a DSPN Approach
This paper describes a way to manage the modeling and analysis of Scheduled Maintenance Systems (SMS) within an analytically tractable context. We chose a significant case study h...
Andrea Bondavalli, Roberto Filippini
AI
2000
Springer
14 years 11 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
CN
2002
127views more  CN 2002»
14 years 11 months ago
Optimal policy for label switched path setup in MPLS networks
An important aspect in designing a multiprotocol label switching (MPLS) network is to determine an initial topology and to adapt it to the traffic load. A topology change in an MP...
Tricha Anjali, Caterina M. Scoglio, Jaudelice Cava...