Titlebook: Matchmaking in Electronic Markets; An Agent-Based Appro Daniel J. Veit Book 2003 Springer-Verlag Berlin Heidelberg 2003 DOM.Electronic Mark

Malnutrition

书目名称Matchmaking in Electronic Markets影响因子(影响力)




书目名称Matchmaking in Electronic Markets影响因子(影响力)学科排名




书目名称Matchmaking in Electronic Markets网络公开度




书目名称Matchmaking in Electronic Markets网络公开度学科排名




书目名称Matchmaking in Electronic Markets被引频次




书目名称Matchmaking in Electronic Markets被引频次学科排名




书目名称Matchmaking in Electronic Markets年度引用




书目名称Matchmaking in Electronic Markets年度引用学科排名




书目名称Matchmaking in Electronic Markets读者反馈




书目名称Matchmaking in Electronic Markets读者反馈学科排名

Diaphragm

蛙鸣声

ing behavior of birds. Each bird represents a single document and flies toward other documents that are similar to it. One limitation of this method of document clustering is its complexity .(..). As the number of documents grows, it becomes increasingly difficult to receive results in a reasonable

COLIC

th goals, considering four criteria. Solving scheduling problems with this number of criteria is missed in the literature. The proposed algorithm is composed of three phases: at the first one, four agents are created to independently optimize four criteria with different random initial solution and

占卜者

Daniel J. Veit generate heuristics. In the latter, the goal is to develop a problem-domain independent strategy to automatically generate a good performing heuristic for specific problems, that is, the input to the algorithm are problems and the output are problem-tailored heuristics. This can be done, for exampl

天然热喷泉

Daniel J. Veitmans cannot objectively determine if one system is more expressive than the other. Most of the text-to-speech systems have a rather flat intonation and do not provide the option of changing the output speech. We therefore present an interactive intonation optimisation method based on the pitch conto

Monotonous

Daniel J. Veitxt mining, web page retrieval, text clustering and text categorization. Current methods for computing the keywords of a document are subject to a series of evolutions. Nevertheless, the methods do not perform well in very high dimensional state spaces. The methods are quite inefficient as they depen

熟练

t of customers. The VRP has two main elements to it, the allocation of visits to routes and the ordering of the visits within each route. The VRP has been investigated by many researchers and there exist many variants which may incorporate constraints such as vehicle capacities, time windows and veh

Indecisive

团结

Daniel J. Veitr environmental impact). The techniques for finding solutions to the Vehicle Routing Problem discussed previously (e.g. Clarke and Wright Chap. . and Evolutionary Algorithms Chap. .), two solution characteristics became apparent; the number of vehicles used and the distance travelled. The approaches