Sciweavers

3894 search results - page 453 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
NIPS
2001
15 years 6 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr
TON
2008
98views more  TON 2008»
15 years 4 months ago
A unified framework for multipath routing for unicast and multicast traffic
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
JUCS
2010
142views more  JUCS 2010»
15 years 3 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
WABI
2007
Springer
15 years 10 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...
COCOON
2010
Springer
15 years 9 months ago
Detecting Areas Visited Regularly
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
Bojan Djordjevic, Joachim Gudmundsson