Sciweavers

868 search results - page 11 / 174
» Finding Most Likely Solutions
Sort
View
ACL
2001
13 years 9 months ago
Fast Decoding and Optimal Decoding for Machine Translation
A good decoding algorithm is critical to the success of any statistical machine translation system. The decoder's job is to find the translation that is most likely according...
Ulrich Germann, Michael Jahr, Kevin Knight, Daniel...
ICLP
1999
Springer
13 years 12 months 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
BMCBI
2008
136views more  BMCBI 2008»
13 years 7 months ago
An efficient method for the prediction of deleterious multiple-point mutations in the secondary structure of RNAs using suboptim
Background: RNAmute is an interactive Java application which, given an RNA sequence, calculates the secondary structure of all single point mutations and organizes them into categ...
Alexander Churkin, Danny Barash
GI
2004
Springer
14 years 1 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
SAC
2010
ACM
14 years 2 months ago
Dual analysis for proving safety and finding bugs
Program bugs remain a major challenge for software developers and various tools have been proposed to help with their localization and elimination. Most present-day tools are base...
Corneliu Popeea, Wei-Ngan Chin