Sciweavers

3894 search results - page 322 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
CCIA
2005
Springer
16 years 7 days ago
Direct Policy Search Reinforcement Learning for Robot Control
— This paper proposes a high-level Reinforcement Learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, whe...
Andres El-Fakdi, Marc Carreras, Narcís Palo...
JOIN
2007
91views more  JOIN 2007»
15 years 6 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
EAAI
2010
119views more  EAAI 2010»
15 years 5 months ago
A heuristic-based framework to solve a complex aircraft sizing problem
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Céline Badufle, Christophe Blondel, Thierry...
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
15 years 10 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki
ACL
2004
15 years 8 months ago
Computing Locally Coherent Discourses
We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measur...
Ernst Althaus, Nikiforos Karamanis, Alexander Koll...