Sciweavers

3818 search results - page 688 / 764
» Learning from Order Examples
Sort
View
121
Voted
ATAL
2008
Springer
15 years 4 months ago
Content-oriented composite service negotiation with complex preferences
In e-commerce, for some cases the service requested by the consumer cannot be fulfilled by the producer. In such cases, service consumers and producers need to negotiate their ser...
Reyhan Aydogan
IJCAI
2003
15 years 3 months ago
Bayesian Information Extraction Network
Dynamic Bayesian networks (DBNs) offer an elegant way to integrate various aspects of language in one model. Many existing algorithms developed for learning and inference in DBNs ...
Leonid Peshkin, Avi Pfeffer
COR
2008
122views more  COR 2008»
15 years 2 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
COR
2006
97views more  COR 2006»
15 years 2 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets
141
Voted
JMLR
2006
124views more  JMLR 2006»
15 years 2 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