Sciweavers

1133 search results - page 93 / 227
» Best Practices in e-Assessment
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
AES
2007
Springer
141views Cryptology» more  AES 2007»
15 years 6 months ago
Numerical methods for modelling leaching of pollutants in soils
Pesticides used in crop production and herbicides used for weed control are the major source of nonpoint-source pollutants to groundwater. The movement and degradation of pesticid...
M. Isabel Asensio, B. Ayuso, Luis Ferragut, G. San...
CORR
2010
Springer
102views Education» more  CORR 2010»
15 years 6 months ago
On the Design of Efficient CSMA Algorithms for Wireless Networks
Recently, it has been shown that CSMA algorithms which use queue length-based link weights can achieve throughput optimality in wireless networks. In particular, a key result by Ra...
Javad Ghaderi, R. Srikant
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 6 months ago
Multi-View Active Learning in the Non-Realizable Case
The sample complexity of active learning under the realizability assumption has been well-studied. The realizability assumption, however, rarely holds in practice. In this paper, ...
Wei Wang, Zhi-Hua Zhou
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
15 years 6 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper