Sciweavers

4679 search results - page 151 / 936
» Modeling When Connections Are the Problem
Sort
View
ICWS
2008
IEEE
15 years 3 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
ECML
2005
Springer
15 years 7 months ago
Active Learning in Partially Observable Markov Decision Processes
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
Robin Jaulmes, Joelle Pineau, Doina Precup
JMLR
2010
104views more  JMLR 2010»
14 years 8 months ago
Increasing Feature Selection Accuracy for L1 Regularized Linear Models
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
Abhishek Jaiantilal, Gregory Z. Grudic
ICRA
2000
IEEE
118views Robotics» more  ICRA 2000»
15 years 6 months ago
Optimal Feedback Control for Route Tracking with a Bounded-Curvature Vehicle
W'e consider the kinematic model of a vehicle moving forward with a lower bounded turning radius. This model, is relevant to describe the kinematics of road vehicles as well ...
Philippe Souères, Andrea Balluchi, Antonio ...
AAAI
2004
15 years 3 months ago
An Instance-Based State Representation for Network Repair
We describe a formal framework for diagnosis and repair problems that shares elements of the well known partially observable MDP and cost-sensitive classification models. Our cost...
Michael L. Littman, Nishkam Ravi, Eitan Fenson, Ri...