Non-deterministic Algorithm for Routing Optimization: A Case Study

A routing optimization problem is solved by a non- deterministic algorithm in this paper. The DNA computing is applied for a case of cable trench problem. The cable trench problem is a combination of the shortest path problem and the minimum spanning tree problem, which makes it difficult to be solv...

Celý popis

Podrobná bibliografia

Vydané v:	ICICIC 2007 : second International Conference on Innovative Computing, Information and Control : 5-7 September 2007 s. 423
Hlavní autori:	Don Jyh-Fu Jeng, Watada, J.
Médium:	Konferenčný príspevok..
Jazyk:	English Japanese
Vydavateľské údaje:	IEEE 01.09.2007
Predmet:	Cost function DNA computing Gradient methods Polynomials Production systems Routing Shortest path problem Temperature Thermodynamics Tree graphs
ISBN:	0769528821, 9780769528823
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!