no problem 毫無(wú)問(wèn)題; 考試家族; 沒(méi)問(wèn)題; 無(wú)問(wèn)題
problem n. 1.問(wèn)題,課題;疑難問(wèn)題;令人困惑的情況。 2.【數(shù)、物】習(xí)題;作圖題。 3.(象棋的)布局問(wèn)題。 the problem of unemployment 失業(yè)問(wèn)題。 His whole conduct is a problem to me. 他的一切行為我都不理解。 adj. 1.成問(wèn)題的;難處理的。 2.關(guān)于社會(huì)問(wèn)題的。 a problem child 【心理學(xué)】問(wèn)題兒童;難管教的孩子。 a problem novel [play] (反映社會(huì)問(wèn)題等的)問(wèn)題小說(shuō)[戲劇]。 sleep on [upon, over] a problem 把問(wèn)題留到第二天解決。
This paper studies a pole placement problem for single input discrete systems which can be translated into the diagonal shape 摘要著重研究了一類可化為對(duì)角線規(guī)范形的單輸入離散線性定常系統(tǒng)的極點(diǎn)配置問(wèn)題,得出一個(gè)新的計(jì)算狀態(tài)反饋矩陣的公式。
From an algebraic approach, the decentralized pole placement problem and robust servomechanism problem were explored; from a geometric approach, the problem of elimination of decentralized fixed modes via time-varying decentralized control was explored 從代數(shù)角度出發(fā),研究了一般真有理系統(tǒng)的分散極點(diǎn)配置問(wèn)題和魯棒跟隨問(wèn)題;從幾何角度出發(fā),研究了利用時(shí)變分散反饋消除分散固定模的問(wèn)題。
This fact implies that the fractal algorithm is very effective and in practical . 2 ) by combining the tabu search and the clustering technique, we propose a hybird algorithm to solve the placement problems, both for the bbl and the gate-array placement . simulation results show that our hybird algorithm is of robustness and effectiveness, it is expected the algorithm is also uesful in other optimization problems . to testify the feasibility of using various computational intelligent algorithm, such as neural networks, genetic algorithm and ant colony system approach in solving a 2)首次將禁忌搜索算法與結(jié)群技術(shù)相結(jié)合,并將其分別應(yīng)用于門陣列布局和bbl布局中,計(jì)算機(jī)模擬結(jié)果表明該算法魯棒性強(qiáng)、有效,適應(yīng)性廣,適用于大規(guī)模門陣列布局和bbl布局問(wèn)題,3)分別用神經(jīng)網(wǎng)絡(luò)技術(shù)、遺傳算法和蟻群算法對(duì)兩端線網(wǎng)布線問(wèn)題進(jìn)行了研究,并對(duì)結(jié)果進(jìn)行了分析比較。
Abstract : an algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells ic design . due to the limitation of computing complexity, an effective and efficient initial placement is very important for detailed placement . novelty of this algorithm lies in a better solution at initial stage by using network-flow method to satisfy row capacity constraint and the thought of linear placement problem ( lpp ) to resolve overlaps . moreover, divide-and-conquer strategy and other simplified methods are adopted to minimize complexity . experimental results show that the algorithm can get an average of 16 wire length improvement on paflo in reasonable cpu time 文摘:以大規(guī)?;旌夏J讲季謫?wèn)題為背景,提出了有效的初始詳細(xì)布局算法.在大規(guī)模混合模式布局問(wèn)題中,由于受到計(jì)算復(fù)雜性的限制,有效的初始布局算法顯得非常重要.該算法采用網(wǎng)絡(luò)流方法來(lái)滿足行容量約束,采用線性布局策略解決單元重疊問(wèn)題.同時(shí),為解決大規(guī)模設(shè)計(jì)問(wèn)題,整體上采用分治策略和簡(jiǎn)化策略,有效地控制問(wèn)題的規(guī)模,以時(shí)間開銷的少量增加換取線長(zhǎng)的明顯改善.實(shí)驗(yàn)結(jié)果表明該算法能夠取得比較好的效果,平均比paflo算法有16的線長(zhǎng)改善,而cpu計(jì)算時(shí)間只有少量增加