نتایج جستجو برای: route finding analysis

تعداد نتایج: 3069907  

2010
Russell D. Hull Sebastian M. Schellong Victor F. Tapson

JULY 2010 his monthly review of select articles has been compiled and prepared as a service to the members of the Clinical Pharmacy and Pharmacology (CPP) Section of the Society of Critical Care Medicine (SCCM). The content below is for information purposes only and is intended to highlight recent articles that may be of interest to the CPP membership. Though some core content from the publicat...

Journal: :Computers & Chemical Engineering 2006
Pinar Erol Jorg Thming

8 Saving of bath chemicals and freshwater consumed within metal finishing systems and the reduction of wastewater produced can be important steps towards more sustainable processes. Furthermore, the application of regenerators is usually energy intensive. Accordingly, in an “eco–eco” (ECO) trade-off, importance should be given to both economic benefits as well as to several ecological measures....

Journal: :IACR Cryptology ePrint Archive 2009
Yiyuan Luo Xuejia Lai Zheng Gong Zhongming Wu

At Asiacrypt’99, Vaudenay modified the structure in the IDEA cipher to a new scheme, which they called as the Lai-Massey scheme. It is proved that 3-round Lai-Massey scheme is sufficient for pseudorandomness and 4-round Lai-Massey scheme is sufficient for strong pseudorandomness. But the author didn’t point out whether three rounds and four rounds are necessary for the pseudorandomness and stro...

2010
Fajie Li Reinhard Klette

So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n log n), published in 2003 by M. Dror, A. Efrat, A. Lubiw, and J. Mitchell. – This paper provides an algorithm with κ(ε) · O(kn) runtime, where n is the number of vertices of the given simple polygon Π, and k the number...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت دبیر شهید رجایی - دانشکده علوم انسانی 1392

abstract due to the growing importance and influence of the self of the teacher in the field of educational and cognitive psychology, the current study intended to investigate the relationship between three teacher qualities and characteristics, i.e. teacher self efficacy, self regulation, and success as perceived by their learners. the study aimed at finding whether teacher self efficacy an...

1997
Brian Logan

Route planning in realistic terrains is a critical task for many autonomous agents such as mobile robots, autonomous vehicles or Computer Generated Forces. The route planning problem is often formulated as one of finding a minimum-cost route between two locations in a digitised map which represents a complex terrain of variable altitude, where the cost of a route is an indication of its quality...

2016
Yukie Ikeda Masahiro Inoue

When a natural disaster occurred, some roads cannot be used anymore and sometimes blocked. Also, survivors and refugees cannot follow the evacuation procedures by just using default maps after disaster. A previous study proposed a safety route guidance system that can be used after natural disasters by using participatory sensing. The system estimates safe routes and generates an evacuation map...

2007
Eliyahu Safra Yaron Kanza Nir Dolev Yehoshua Sagiv Yerach Doytsher

An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how likely it is for the object to be correct. Uncertain data can be the result of operations such as imprecise integration, incorrect update or inexact querying. A k-route, over an uncertain geo-spatial dataset, is a path th...

Journal: :CoRR 2009
Alex A. Stewart Marta F. Antoszkiewicz

The Border Gateway Protocol (BGP) is an important component in today’s IP network infrastructure. As the main routing protocol of the Internet, clear understanding of its dynamics is crucial for configuring, diagnosing and debugging Internet routing problems. Despite the increase in the services that BGP provide such as MPLS VPNs, there is no much progress achieved in automating the BGP managem...

2010
Alexandros Koliousis

The routing problem (finding an optimal route from one point in a computer network to another) is surrounded by impossibility results. These results are usually expressed as lower and upper bounds on the set of nodes (or the set of links) of a network and represent the complexity of a solution to the routing problem (a routing function). The routing problem dealt with here, in particular, is a ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید