Sciweavers

20066 search results - page 3902 / 4014
» T Spaces
Sort
View
JMLR
2006
124views more  JMLR 2006»
15 years 4 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
MAGS
2008
104views more  MAGS 2008»
15 years 4 months ago
Retractable contract network for empowerment in workforce scheduling
This paper is about business modelling and negotiation protocol design in distributed scheduling, where individual agents have individual (potentially conflicting) interests. It i...
Edward P. K. Tsang, Timothy Gosling, Botond Virgin...
JSAC
2006
105views more  JSAC 2006»
15 years 4 months ago
Network Topology Inference Based on End-to-End Measurements
Abstract--We consider using traceroute-like end-to-end measurement to infer the underlay topology for a group of hosts. One major issue is the measurement cost. Given hosts in an a...
Xing Jin, Wai-Pun Ken Yiu, S.-H. Gary Chan, Yajun ...
182
Voted
ML
2008
ACM
248views Machine Learning» more  ML 2008»
15 years 4 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
JSC
2006
52views more  JSC 2006»
15 years 4 months ago
Markov bases of three-way tables are arbitrarily complicated
We show the following two universality statements on the entry-ranges and Markov bases of spaces of 3-way contingency tables with fixed 2-margins: (1) For any finite set D of nonn...
Jesús A. De Loera, Shmuel Onn
« Prev « First page 3902 / 4014 Last » Next »