Sciweavers

526 search results - page 65 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
VLDB
2005
ACM
125views Database» more  VLDB 2005»
16 years 4 months ago
Sync your data: update propagation for heterogeneous protein databases
The traditional model of bench (wet) chemistry in many life sciences domain is today actively complimented by computer-based discoveries utilizing the growing number of online data...
Kajal T. Claypool, Elke A. Rundensteiner
CP
2010
Springer
15 years 2 months ago
Load Balancing and Almost Symmetries for RAMBO Quorum Hosting
Abstract. Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where t...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
127
Voted
ATAL
2010
Springer
15 years 5 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham
WSC
1997
15 years 5 months ago
Single Run Optimization Using the Reverse-Simulation Method
An efficient “Simulation Optimization” technique is developed to solve system design problems which can not be expressed in explicit analytical or mathematical models. In part...
Young Hae Lee, Kyoung Jong Park, Yun Bae Kim
BMCBI
2010
123views more  BMCBI 2010»
15 years 4 months ago
Decoding HMMs using the k best paths: algorithms and applications
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
Daniel G. Brown 0001, Daniil Golod