Sciweavers

2695 search results - page 358 / 539
» Learning Graph Matching
Sort
View
SAINT
2003
IEEE
15 years 8 months ago
Planning For Web Services the Hard Way
In this paper we outline a framework for performing automated discovery, composition and execution of web services based solely on the information available in interface descripti...
Mark James Carman, Luciano Serafini
COLT
2003
Springer
15 years 8 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
IPPS
1998
IEEE
15 years 7 months ago
Using the BSP Cost Model to Optimise Parallel Neural Network Training
We derive cost formulae for three di erent parallelisation techniques for training supervised networks. These formulae are parameterised by properties of the target computer archit...
R. O. Rogers, David B. Skillicorn
ICGI
1994
Springer
15 years 7 months ago
Computer Assisted Grammar Construction
: This paper proposes a new inference approach for Chinese probabilistic context-free grammar, which implements the EM algorithm based on the bracket matching schemes. By utilizing...
S. J. Young, H.-H. Shih
EUROGP
2000
Springer
15 years 6 months ago
Seeding Genetic Programming Populations
We show genetic programming (GP) populations can evolve under the influence of a Pareto multi-objective fitness and program size selection scheme, from "perfect" programs...
William B. Langdon, Peter Nordin