Sciweavers

81 search results - page 8 / 17
» Decision Theoretic Dialogue Planning for Initiative Problems
Sort
View
JSAT
2008
122views more  JSAT 2008»
14 years 9 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
ERSHOV
2006
Springer
14 years 11 months ago
Verifying Generalized Soundness of Workflow Nets
We improve the decision procedure from [10] for the problem of generalized soundness of workflow nets. A workflow net is generalized sound iff every marking reachable from an initi...
Kees M. van Hee, Olivia Oanea, Natalia Sidorova, M...
ECAI
2010
Springer
14 years 10 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
NETWORKING
2004
14 years 11 months ago
Pricing Differentiated Services: A Game-Theoretic Approach
The goal of this paper is to study pricing of differentiated services and its impact on the choice of service priority at equilibrium. We consider both TCP connections as well as n...
Eitan Altman, Dhiman Barman, Rachid El Azouzi, Dav...
81
Voted
ECAI
2010
Springer
14 years 9 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...