Sciweavers

3082 search results - page 248 / 617
» New Bounds for the Controller Problem
Sort
View
BMCBI
2010
86views more  BMCBI 2010»
15 years 6 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
156
Voted
AUTOMATICA
1999
84views more  AUTOMATICA 1999»
15 years 6 months ago
Optimizing the receiver maneuvers for bearings-only tracking
This paper deals with the optimization of the observer trajectory for target motion analysis. The observations are made of estimated bearings. The problem consists in determining ...
Jean-Pierre Le Cadre, S. Laurent-Michel
WINE
2009
Springer
178views Economy» more  WINE 2009»
16 years 1 months ago
The Geometry of Truthfulness
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
Angelina Vidali
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
16 years 1 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
15 years 1 months ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu