نتایج جستجو برای: greedy geographic forwarding based on geospatial division algorithm

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

Journal: :Journal of physics 2021

Aiming at the problem of furnace temperature curve, this paper uses Fourier's law heat conduction and Newton's cooling to establish a transfer model obtain changing welding area curve; single-objective optimization maximum conveyor belt passing speed find out optimal for each zone; greedy algorithm traversal search are used undetermined parameters dual-objective through local optimization. In r...

Journal: :Information 2016
Feng Zhang Yuetong Xu

With rapid development and application of mobile internet, geographic information in the field of business process is now more widely used. There are more and more researches in the field of the relationships between geographic information and workflow modeling. According to the workflow with geospatial constraints, this paper first discusses the geospatial constraints theory deeply, proposes a...

2010
Ming Li

One of the key challenges in geographic routing is how to deal with dead-ends, where greedy routing fails to find a neighbor node which is closer to the destination. Most existing geographic routing algorithms just switch to the deterministic face routing or limits its face searching range. In this paper, we demonstrate that we can improve routing performance by considering local connectivity s...

Journal: :Telecommunication Systems 2003
Pedro Acevedo Contla Milos Stojmenovic

The recent availability of small, inexpensive low power GPS receivers and techniques for finding relative coordinates based on signal strengths, and the need for the design of power efficient and scalable networks, provided justification for applying position based routing methods in ad hoc networks. A number of such algorithms were developed recently. They are all based on three greedy schemes...

Journal: :CoRR 2009
Mohsen Ghaffari Behnoosh Hariri Shervin Shirmohammadi

Large scale decentralized communication systems have introduced the new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among the simplest and most common online routing schemes. A perfect geometrical routing scheme is expected to deliver each packet to the point in the network that...

2007
P. M. TORRENS

In this paper, I introduce a new approach to agent-based modeling in geospatial contexts. The novelty of the approach stems from introducing geospatial functionality as an exoskeletal wrapper around standard socio-communicative and goal-oriented agent-based AI. Operationally, I also introduce an integrated and symbiotic tight-coupling to motion capture and Geographic Information Systems, based ...

2013
Feriel Abdelkoui Mohamed-Khireddine Kholladi

During the search for geographical information in web pages, people are geo-referred with toponyms (place names) instead the use of coordinates. The conceptions of places are often complicated ambiguous and different in different time. When gazetteers are utilized as background knowledge in geographic information retrieval (GIR), they are limited because of their poor geographic semantics. Ther...

2012
Shuo Guo Haiyong Xie Guangyu Shi

Content caching plays an important role in content-centric networks. The current design of content-centric networks adopts a limited, en-route hierarchical caching mechanism, and caching and forwarding are largely uncoordinated. In this paper, we propose a novel collaborative caching and forwarding design. In this design, collaboration is guided by content popularity ranking, based on which we ...

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

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