Sciweavers

502 search results - page 50 / 101
» Monotone Approximation of Decision Problems
Sort
View
PCM
2004
Springer
144views Multimedia» more  PCM 2004»
15 years 3 months ago
Dynamic Programming Based Adaptation of Multimedia Contents in UMA
Content adaptation is an effective solution to support the quality of service for multimedia services over heterogeneous networks. This paper deals with the accuracy and the real-...
Truong Cong Thang, Yong Ju Jung, Yong Man Ro
94
Voted
CPAIOR
2008
Springer
14 years 11 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck
FOSSACS
2005
Springer
15 years 3 months ago
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...
Andrzej S. Murawski, Igor Walukiewicz
SAT
2005
Springer
145views Hardware» more  SAT 2005»
15 years 3 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman
IJCAI
1997
14 years 11 months ago
Extracting Propositions from Trained Neural Networks
This paper presents an algorithm for extract­ ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
Hiroshi Tsukimoto