DMBT-清華 信道估計算法 [Fang Yang] Novel decision-directed channel estimation method for TDS-OFDM system [C]2008 (Tsinghua)
標簽： decision-directed estimation TDS-OFDM channel
上傳時間： 2013-12-21
上傳用戶：jjj0202
Decision 算法
上傳時間： 2013-12-23
上傳用戶：wys0120
Quality, object.oriented architecture is the product of careful study, decision making, and experimentation. At a minimum, the object.oriented architecture process includes farming of requirements, architecture mining, and hands.on experience. Ideally, object.oriented architecture comprises a set of high.quality design decisions that provide benefits throughout the life cycle of the system.
標簽： architecture decision oriented Quality
上傳時間： 2014-10-28
上傳用戶：love_stanford
THE DECISION TREE ALGORITHM USED VC
標簽： ALGORITHM DECISION TREE USED
上傳時間： 2014-08-10
上傳用戶：1051290259
Expert Choice represents a significant contribution to the decision making process 工t assists a decision maker in solving complex problems involving many criteria and several courses of action . An Expert Choice solution to a problem reflects the expertise of the decision maker , not the computer . Behavioral scientists have spent many years studying the human mind and how it makes decisions . They have found that humans are influenced by their previous experiences and this causes them to have biases . Basic instincts , preferences and environmental factors also play key roles in how we analyze data and make decisions . There 15 way to remove these factors from human decision making , nor would we necessarily want to , but as the problems of our world become more and more complex , it 15 necessary for us to employ a framework to help make more logical and less biased decisions while still taking our feelings and intuition into consideration .
標簽： contribution significant represents decision
上傳時間： 2015-06-02
上傳用戶：gmh1314
多階段決策過程（ multistep decision process ）是指 這樣一類特殊的活動過程，過程可以按時間順序分解成若干個相互聯系的階段，在每一個階段都需要做出決策，全部過程的決策是一個決策序列。 動態規劃 （ dynamic programming ）算法 是解決 多階段決策過程最優化問題 的一種常用方法，難度比較大，技巧性也很強。利用動態規劃算法，可以優雅而高效地解決很多貪婪算法或分治算法不能解決的問題。動態規劃算法的基本思想是：將待求解的問題分解成若干個相互聯系的子問題，先求解子問題，然后從這些子問題的解得到原問題的解； 對于重復出現的子問題，只在第一次遇到的時候對它進行求解，并把答案保存起來，讓以后再次遇到時直接引用答案，不必重新求解 。動態規劃算法將問題的解決方案視為一系列決策的結果，與貪婪算法不同的是，在貪婪算法中，每采用一次貪婪準則，便做出一個不可撤回的決策；而在動態規劃算法中，還要考察每個最優決策序列中是否包含一個最優決策子序列，即問題是否具有最優子結構性質。
標簽： multistep decision process 過程
上傳時間： 2015-06-09
上傳用戶：caozhizhi
Simulation of RM(1,3), equivalent to the (8,4,4) extended Hamming code. Soft-decision decoding performed by the Green machine
標簽： Soft-decision Simulation equivalent decoding
上傳時間： 2015-07-05
上傳用戶：lindor
machine learning, accuracy estimation, cross-validation, bootstrap, ID3, decision trees, decision graphs, naive-bayes, decision tables, majority, induction algorithms, classifiers, categorizers, general logic diagrams, instance-based algorithms, discretization, lazy learning, bagging, MineSet.
標簽： decision cross-validation estimation bootstrap
上傳時間： 2015-07-26
上傳用戶：趙云興
Find a classification error for a given decision surface D and a given set of patterns and targets
標簽： given classification and decision
上傳時間： 2013-12-18
上傳用戶：xinzhch
Hard-decision decoding scheme Codeword length (n) : 31 symbols. Message length (k) : 19 symbols. Error correction capability (t) : 6 symbols One symbol represents 5 bit. Uses GF(2^5) with primitive polynomial p(x) = X^5 X^2 + 1 Generator polynomial, g(x) = a^15 a^21*X + a^6*X^2 + a^15*X^3 + a^25*X^4 + a^17*X^5 + a^18*X^6 + a^30*X^7 + a^20*X^8 + a^23*X^9 + a^27*X^10 + a^24*X^11 + X^12. Note: a = alpha, primitive element in GF(2^5) and a^i is root of g(x) for i = 19, 20, ..., 30. Uses Verilog description with synthesizable RTL modelling. Consists of 5 main blocks: SC (Syndrome Computation), KES (Key Equation Solver), CSEE (Chien Search and Error Evaluator), Controller and FIFO Register.
標簽： symbols length Hard-decision Codeword
上傳時間： 2014-07-08
上傳用戶：曹云鵬
