Sciweavers

499 search results - page 81 / 100
» A Dynamic-Programming Based ASP-Solver
Sort
View
ECML
2007
Springer
13 years 11 months ago
Sequence Labeling with Reinforcement Learning and Ranking Algorithms
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
Francis Maes, Ludovic Denoyer, Patrick Gallinari
ACL
2008
13 years 11 months ago
Efficient, Feature-based, Conditional Random Field Parsing
Discriminative feature-based methods are widely used in natural language processing, but sentence parsing is still dominated by generative methods. While prior feature-based dynam...
Jenny Rose Finkel, Alex Kleeman, Christopher D. Ma...
AAAI
2010
13 years 11 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 11 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
WSC
2004
13 years 11 months ago
A Near Optimal Approach to Quality of Service Data Replication Scheduling
This paper describes an approach to real-time decisionmaking for quality of service based scheduling of distributed asynchronous data replication. The proposed approach addresses ...
Kevin Adams, Denis Gracanin, Dusan Teodorovic