Sciweavers

530 search results - page 22 / 106
» A New Iterative Method for Solving Initial Value Problems
Sort
View
ICRA
2008
IEEE
167views Robotics» more  ICRA 2008»
14 years 3 months ago
An approximate algorithm for solving oracular POMDPs
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
Nicholas Armstrong-Crews, Manuela M. Veloso
IFIP
2005
Springer
14 years 2 months ago
On Warm Starts for Interior Methods
An appealing feature of interior methods for linear programming is that the number of iterations required to solve a problem tends to be relatively insensitive to the choice of in...
Anders Forsgren
CONSTRAINTS
2008
78views more  CONSTRAINTS 2008»
13 years 8 months ago
Boosting Haplotype Inference with Local Search
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
Inês Lynce, João Marques-Silva, Steve...
BMCBI
2010
87views more  BMCBI 2010»
13 years 8 months ago
Prodigal: prokaryotic gene recognition and translation initiation site identification
Background: The quality of automated gene prediction in microbial organisms has improved steadily over the past decade, but there is still room for improvement. Increasing the num...
Doug Hyatt, Gwo-Liang Chen, Philip F. LoCascio, Mi...
ICLP
1999
Springer
14 years 27 days ago
Finding Fair Allocations for the Coalition Problem with Constraints
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
Evan Tick, Roland H. C. Yap, Michael J. Maher