Sciweavers

4843 search results - page 361 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
AAAI
2008
15 years 6 months ago
Minimizing the Spread of Contamination by Blocking Links in a Network
We address the problem of minimizing the propagation of undesirable things, such as computer viruses or malicious rumors, by blocking a limited number of links in a network, a dua...
Masahiro Kimura, Kazumi Saito, Hiroshi Motoda
ACST
2006
15 years 5 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara
ICML
1996
IEEE
15 years 8 months ago
A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
Rémi Munos
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
15 years 8 months ago
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
Khaled M. Elbassioni, René Sitters, Yan Zha...
TMC
2010
196views more  TMC 2010»
15 years 2 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
Mahmoud Al-Ayyoub, Himanshu Gupta