Sciweavers

2343 search results - page 49 / 469
» The Locomotive Routing Problem
Sort
View
ESA
2007
Springer
97views Algorithms» more  ESA 2007»
14 years 1 months ago
To Fill or Not to Fill: The Gas Station Problem
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
Samir Khuller, Azarakhsh Malekian, Julián M...
EURODAC
1995
IEEE
133views VHDL» more  EURODAC 1995»
13 years 11 months ago
Tree restructuring approach to mapping problem in cellular-architecture FPGAs
A new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs is presented. The proposed tree restructuring algorithm preserves local connectivity a...
Naveen Ramineni, Malgorzata Chrzanowska-Jeske, Nav...
IPOM
2009
Springer
14 years 2 months ago
A Feasibility Evaluation on Name-Based Routing
Abstract. The IPv4 addressing scheme has been the standard for Internet communication since it was established in the 1960s. However, the enormous increase in Internet traffic usag...
Haesung Hwang, Shingo Ata, Masayuki Murata
ISPEC
2005
Springer
14 years 1 months ago
Robust Routing in Malicious Environment for Ad Hoc Networks
Abstract. Secure routing in ad hoc networks has been extensively studied in recent years. The vast majority of this work, however, has only focused on providing authenticity of the...
Zhongchao Yu, Chuk-Yang Seng, Tao Jiang, Xue Wu, W...
ISPD
1999
ACM
89views Hardware» more  ISPD 1999»
13 years 12 months ago
VIA design rule consideration in multi-layer maze routing algorithms
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
Jason Cong, Jie Fang, Kei-Yong Khoo