Sciweavers

3628 search results - page 295 / 726
» The Decision Diffie-Hellman Problem
Sort
View
MST
2010
140views more  MST 2010»
15 years 5 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
16 years 25 days ago
Methodology to select solutions from the pareto-optimal set: a comparative study
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
José C. Ferreira, Carlos M. Fonseca, Ant&oa...
STACS
1993
Springer
15 years 10 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
BROADNETS
2004
IEEE
15 years 10 months ago
Efficient QoS Provisioning for Adaptive Multimedia in Mobile Communication Networks by Reinforcement Learning
The scarcity and large fluctuations of link bandwidth in wireless networks have motivated the development of adaptive multimedia services in mobile communication networks, where i...
Fei Yu, Vincent W. S. Wong, Victor C. M. Leung
ICML
2007
IEEE
16 years 7 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi