Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Publications
The Crofting Problem

The Crofting Problem,10.2307/2591252,Economic History Review,M. Gray,Adam Collier

Edit
The Crofting Problem   (Citations: 307)
BibTex | RIS | RefWorks Download
Journal: Economic History Review - ECON HIST REV , vol. 7, no. 1, 1954
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...All tests presented in this section and in the rest of this paper are done with the Swarmanoid simulator [23], which was developed as part of the Swarmanoid project...
    • ...The sensor nodes calculate the shortest path through the network using a routing algorithm such as Bellman-Ford routing [3], and use this to guide the robot...

    Frederick Ducatelle, et al. Cooperative self-organization in a heterogeneous swarm robotic system

    • ...We note that the fastest algorithm for the single source shortest path in real weighted directed graphs requires O(nm) time; the Bellman-Ford algorithm [2]...

    Sourav Chakraborty, et al. Two-phase Algorithms for the Parametric Shortest Path Problem

    • ...The first algorithmical results were derived by Bellman [3] and Dijkstra [12], achieving a complexity of O(mn) and O(n2 + m), respectively, were n denotes the number of vertices and m denotes the number of edges in the network...

    Sebastian Kluge, et al. New complexity results for time-constrained dynamical optimal path pro...

    • ...At it’s heart ICE is a Bellman-Ford shortest path algorithm[2, 37] with incremental maintenance of two spanning trees, giving tightest bounds on earliest start/latest end times...

    Christopher W. Geib, et al. A probabilistic plan recognition algorithm based on plan tree grammars

    • ...Moore (bfm) [1, 9, 15], which maintains labeled vertices in a queue: each newly labeled vertex is added to the back, and the next vertex to be scanned is removed from the front...
    • ...Each graph consists of a random Hamiltonian cycle and m − n additional random arcs, with lengths chosen uniformly at random from [1,1000]...
    • ...In 2-dimensional grids with wrap-around, each vertex is connected to its neighbor above (in the same column) by a short arc (with length in [1,100]), and to its neighbor to the right (in the next column) by a long arc (length in [1000,10000])...
    • ...Graphs are partitioned into layers, each containing a cycle of length 32 plus 64 random arcs (all with lengths in the range [1,100])...
    • ...Each vertex also has five arcs to forward layers (with wrap-around): an arc going x layers forward has length picked uniformly at random from [1,10000] and multiplied by x2. All TOR families have a source connected to the first layer/column by zero-length arcs...

    Loukas Georgiadis, et al. An Experimental Study of Minimum Mean Cycle Algorithms

Sort by:

Citations (307)

Share this on