Welcome, visitor! [ Login

 

D. K. Cheng, “Linear System Analysis,” Addison-wesley Publishing Company, New Jersey, 1959.

  • Listed: 25 July 2026 20 h 06 min

Description

D. K. Cheng, “Linear System Analysis,” Addison-wesley Publishing Company, New Jersey, 1959.

None

No Tags

12 total views, 1 today

  

Listing ID: N/A

Report problem

Processing your request, Please wait....

Sponsored Links

 

S. Saunders, T. Takaoka, “Improved shortest path algorithms for nearly acyc...

S. Saunders, T. Takaoka, “Improved shortest path algorithms for nearly acyclic graphs,” Electronic Notes in Theoretical Computer Science, Vol. 42, pp. 1–17, 2001. None

No views yet

 

Y. Han, “Improved algorithm for all pairs shortest paths,” Information Proc...

Y. Han, “Improved algorithm for all pairs shortest paths,” Information Processing Letters, Vol. 91, pp. 245–250, 2004. Here’s a thinking process: 1. **Analyze User Input:** […]

No views yet

 

Y. Asano and H. Imai, “Practical efficiency of the linear-time algorithm fo...

Y. Asano and H. Imai, “Practical efficiency of the linear-time algorithm for the single source shortest path problem,” Journal of the Operations Research Society of […]

1 total views, 1 today

 

A. V. Goldberg, “Scaling algorithms for the shortest paths problem,” In: Pr...

A. V. Goldberg, “Scaling algorithms for the shortest paths problem,” In: Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 222–231, 1993. **“A. V. […]

No views yet

 

A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, “Sorting in linear time...

A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, “Sorting in linear time?” In Proceedings of 27th ACM Symposium on Theory of Computing, pp. 427–436, […]

1 total views, 1 today

 

R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan, “Faster algorithms...

R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan, “Faster algorithms for the shortest path problem,” Technical Report CS-TR-154-88, Department of Computer […]

No views yet

 

L. A. Zadeh, “Fuzzy sets as a basis for a theory of possibility,” Fuzzy Set...

L. A. Zadeh, “Fuzzy sets as a basis for a theory of possibility,” Fuzzy Sets and Systems, Vol. 1, pp. 3–28, 1978. **”Fuzzy Sets as […]

1 total views, 1 today

 

S. Okada and T. Soper, “A shortest path problem on a network with fuzzy arc...

S. Okada and T. Soper, “A shortest path problem on a network with fuzzy arc lengths,” Fuzzy Sets and Systems, Vol. 109, pp. 129–140, 2000. […]

No views yet

 

S. Okada and M. Gen, “Fuzzy shortest path problem,” Computers & Industr...

S. Okada and M. Gen, “Fuzzy shortest path problem,” Computers & Industrial Engineering, Vol. 27, pp. 465– 468, 1994. None

1 total views, 1 today

 

S. Okada and M. Gen, “Order relation between intervals and its application ...

S. Okada and M. Gen, “Order relation between intervals and its application to shortest path problem,” Computers & Industrial Engineering, Vol. 25, 147–150, 1993. **S. […]

1 total views, 1 today

 

S. Saunders, T. Takaoka, “Improved shortest path algorithms for nearly acyc...

S. Saunders, T. Takaoka, “Improved shortest path algorithms for nearly acyclic graphs,” Electronic Notes in Theoretical Computer Science, Vol. 42, pp. 1–17, 2001. None

No views yet

 

Y. Han, “Improved algorithm for all pairs shortest paths,” Information Proc...

Y. Han, “Improved algorithm for all pairs shortest paths,” Information Processing Letters, Vol. 91, pp. 245–250, 2004. Here’s a thinking process: 1. **Analyze User Input:** […]

No views yet

 

Y. Asano and H. Imai, “Practical efficiency of the linear-time algorithm fo...

Y. Asano and H. Imai, “Practical efficiency of the linear-time algorithm for the single source shortest path problem,” Journal of the Operations Research Society of […]

1 total views, 1 today

 

A. V. Goldberg, “Scaling algorithms for the shortest paths problem,” In: Pr...

A. V. Goldberg, “Scaling algorithms for the shortest paths problem,” In: Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 222–231, 1993. **“A. V. […]

No views yet

 

A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, “Sorting in linear time...

A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, “Sorting in linear time?” In Proceedings of 27th ACM Symposium on Theory of Computing, pp. 427–436, […]

1 total views, 1 today

 

R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan, “Faster algorithms...

R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan, “Faster algorithms for the shortest path problem,” Technical Report CS-TR-154-88, Department of Computer […]

No views yet

 

L. A. Zadeh, “Fuzzy sets as a basis for a theory of possibility,” Fuzzy Set...

L. A. Zadeh, “Fuzzy sets as a basis for a theory of possibility,” Fuzzy Sets and Systems, Vol. 1, pp. 3–28, 1978. **”Fuzzy Sets as […]

1 total views, 1 today

 

S. Okada and T. Soper, “A shortest path problem on a network with fuzzy arc...

S. Okada and T. Soper, “A shortest path problem on a network with fuzzy arc lengths,” Fuzzy Sets and Systems, Vol. 109, pp. 129–140, 2000. […]

No views yet

 

S. Okada and M. Gen, “Fuzzy shortest path problem,” Computers & Industr...

S. Okada and M. Gen, “Fuzzy shortest path problem,” Computers & Industrial Engineering, Vol. 27, pp. 465– 468, 1994. None

1 total views, 1 today

 

S. Okada and M. Gen, “Order relation between intervals and its application ...

S. Okada and M. Gen, “Order relation between intervals and its application to shortest path problem,” Computers & Industrial Engineering, Vol. 25, 147–150, 1993. **S. […]

1 total views, 1 today