Sciweavers

155 search results - page 23 / 31
» A Comparison Between ACO Algorithms for the Set Covering Pro...
Sort
View
JAIR
2006
160views more  JAIR 2006»
13 years 8 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
BMCBI
2010
106views more  BMCBI 2010»
13 years 8 months ago
Multiple structure alignment and consensus identification for proteins
Background: An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructu...
Ivaylo Ilinkin, Jieping Ye, Ravi Janardan
ACL
2009
13 years 6 months ago
Incremental HMM Alignment for MT System Combination
Inspired by the incremental TER alignment, we re-designed the Indirect HMM (IHMM) alignment, which is one of the best hypothesis alignment methods for conventional MT system combi...
Chi-Ho Li, Xiaodong He, Yupeng Liu, Ning Xi
FSTTCS
2009
Springer
14 years 3 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
14 years 1 months ago
Simultaneity Matrix for Solving Hierarchically Decomposable Functions
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
Chatchawit Aporntewan, Prabhas Chongstitvatana