您要查找的是不是：
- control problem.The designed implementation of a hardware and software system which results from the analysis of a
- [+problem，task] 面臨某事to be confronted with sth
- [+task，problem] 把某事提交給to refer sth to
- bottleneck problem (瓶頸問(wèn)題)薄弱環(huán)節問(wèn)題
- [+problem，difficulty] 繞過(guò)某事to get round sth
- [(problem)+] 是件（令某人）頭痛的事to be a headache (for sb)
- [+problem，situation，task] 妥善地處理某事/做某事to cope with sth/with doing sth
- 凡是響應客戶(hù)的要求從而開(kāi)發(fā)的產(chǎn)品則以CP編號，CP是代表customer Problem.A product which is developed in response to a customer's request for help is given a CP number?Customer Problem.
- 車(chē)輛路徑問(wèn)題(Vehicle Routing Problem，VRP)是物流運輸研究領(lǐng)域內一個(gè)非常重要的問(wèn)題。Vehicle Routing Problem, or VRP, is a very important sub problem inborn in many distribution systems.
- 我們回答了Boas提出的兩個(gè)open problem更進(jìn)一步我們證明了大量非光滑邊界擬凸域上穩定性定理成立。We first answer two open problems of Boas. Furthermore, we prove the stability theorem of the Bergman kernel for various non-smooth pseudoconvex domains.
- CPS(Creative Problem Solving)是由大腦風(fēng)暴法(Brainstorming)發(fā)展而來(lái)的一種創(chuàng )造性問(wèn)題解決模式。CPS (Creative Problem Solving) is a model of creative problem solving, which developed from Brainstorming. This model completes the process of creative problem solving through several steps, such as problem finding, data finding, idea finding and so on.
- 基于以上分析,我們給出了BCP和單約束最短路徑問(wèn)題(RSP,restricted shortest path problem)的近似算法,并對算法性能進(jìn)行了分析;Based on this analysis, we propose approximate algorithms on BCP and RSP(restricted shortest path problem) and make performance analysis on them.
- PBT(Problem-based Teaching,直譯是:基于問(wèn)題的教學(xué))是一種很好的教學(xué)模式,在國外醫學(xué)院已經(jīng)被廣泛采用,但在國內還處于試行階段。PBT(Problem-based Teaching,literally means teaching based on problems) as a good teaching mode,has been widely adopted by foreign medicine schools,but it is still on experiment in China.
- 作業(yè)車(chē)間調度問(wèn)題(Job Shop Scheduling Problem,簡(jiǎn)稱(chēng)JSSP)是一個(gè)非常復雜的NP-難組合優(yōu)化問(wèn)題,它在工程應用中有著(zhù)十分重要的意義。Job shop scheduling problem (JSSP) is a very difficult combinatorial optimization problem, which is proved to be NP-hard. It has great importance in engineering application and academic study.
- TSP(Traveling Salesman Problem,旅行商問(wèn)題)是組合優(yōu)化領(lǐng)域的重要問(wèn)題之一,同時(shí)也是眾多現實(shí)問(wèn)題的原形,對其開(kāi)展深入廣泛的研究具有重要的理論價(jià)值和實(shí)用價(jià)值。TSP is a typical problem of its genre: combinatorial optimization, furthermore, TSP is the original form of many realistic problems. So, that taking a thorough and broad study on TSP has important theory value and practical value.
- 本文針對傳統的求解有時(shí)間窗的車(chē)輛路徑問(wèn)題(Vehicle Routing Problem with TimeWindows，VRPTW)建模與求解過(guò)程對專(zhuān)家的依賴(lài)性強的缺陷，研究VRPTW模型的知識表示問(wèn)題。Aiming at overcoming deficiencies in the conventional process of modeling and solving Vehicle Routing Problem with Time Windows (VRPTW), this paper focuses on the knowledge-based model representation for VRPTW.
- 車(chē)輛路由問(wèn)題（Vehicle Routing Problem，VRP）[4]最早由Dantzig于1959年提出，是運籌學(xué)中的熱點(diǎn)研究問(wèn)題，其原型是旅行商問(wèn)題（Traveling Salesman Problem, TSP）[5]。In this dissertation, a modified Particle Swarm Optimization (PSO) algorithm was proposed to solve TSP, which is a well-known NP-hard problem.
- 本文以基于網(wǎng)絡(luò )的零件庫技術(shù)以及裝配約束滿(mǎn)足問(wèn)題(Assembly Constraint Satisfaction Problem，ACSP)為主線(xiàn)，對集成化的智能CAD進(jìn)行了研究，建立了基于PPLIB(Parametric Parts LIBrary)的裝配圖參數化設計系統。Our discussion is focused on parts library technology based on network and assembly constraint satisfaction problem (ACSP). In this paper we present a deep study on integrated ICAD and build a parametric design system of assembly drawing based on PPLD3 (Parametric Parts Library). Firstly, the background and related work in the field of integrated ICAD research are introduced.
- 共產(chǎn)國際執行局
