Sciweavers

7930 search results - page 559 / 1586
» Greedy in Approximation Algorithms
Sort
View
ATAL
2007
Springer
16 years 1 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 11 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
JCB
2007
168views more  JCB 2007»
15 years 7 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
GLOBECOM
2007
IEEE
16 years 1 months ago
Capacity and Fairness of MIMO Broadcast Algorithms in Shadow Fading Environments
Abstract— For MIMO broadcast systems the effects of shadowing on the channel capacity and the fairness of the system in sharing the resources amongst multiple users are important...
Timothy W. King, Peter J. Smith, Lee M. Garth
INFOCOM
2007
IEEE
16 years 1 months ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
Weiyi Zhang, Guoliang Xue, Satyajayant Misra