Results 31 to 40 of about 208,662 (295)

Smoothed Analysis of the Successive Shortest Path Algorithm [PDF]

open access: yesProceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
The minimum-cost flow problem is a classic problem in combinatorial optimization with various applications. Several pseudo-polynomial, polynomial, and strongly polynomial algorithms have been developed in the past decades, and it seems that both the problem and the algorithms are well understood.
Tobias Brunsch   +3 more
openaire   +2 more sources

Research and Implementation of Global Path Planning for Unmanned Surface Vehicle Based on Electronic Chart

open access: yes, 2017
Unmanned Surface Vehicle (USV) is a new type of intelligent surface craft, and global path planning is the key technology of USV research, which can reflect the intelligent level of USV.
Li, Baoan   +3 more
core   +1 more source

Decarbonizing development: three steps to a zero-carbon future [PDF]

open access: yes, 2015
This report lays out three steps for a smooth transition to a zero-carbon future and provides data, examples and policy advice to help countries makes the shift. Overview Getting to zero net emissions and stabilizing climate change starts with planning
Adrien Vogt-Schilb   +5 more
core   +1 more source

On causal extrapolation of sequences with applications to forecasting

open access: yes, 2018
The paper suggests a method of extrapolation of notion of one-sided semi-infinite sequences representing traces of two-sided band-limited sequences; this features ensure uniqueness of this extrapolation and possibility to use this for forecasting.
Dokuchaev, Nikolai
core   +1 more source

Smoothed Analysis of the Successive Shortest Path Algorithm [PDF]

open access: yesSIAM Journal on Computing, 2015
A preliminary version has been presented at SODA ...
Tobias Brunsch   +4 more
openaire   +4 more sources

CAF-RRT*: A 2D Path Planning Algorithm Based on Circular Arc Fillet Method

open access: yesIEEE Access, 2022
To improve the previous versions of Rapidly-exploring Random Trees (RRT) algorithms, a novel algorithm based on Circular Arc Fillet (CAF-RRT*) for path planning problems in two-dimension workspaces is proposed.
Binpeng Wang   +4 more
doaj   +1 more source

Sequential Monte Carlo smoothing with application to parameter estimation in non-linear state space models

open access: yes, 2008
This paper concerns the use of sequential Monte Carlo methods (SMC) for smoothing in general state space models. A well-known problem when applying the standard SMC technique in the smoothing mode is that the resampling mechanism introduces degeneracy of
Cappé, Olivier   +4 more
core   +4 more sources

Research on path planning methods for autonomous dump trucks in open-pit mines

open access: yesMeitan kexue jishu
To address the requirements for left-side driving and the issue of smoothing efficiency for long-distance transportation routes of mining dump trucks in open-pit mine environments, a path planning method that combines a left-side driving hybrid A ...
Jiade HUANG   +3 more
doaj   +1 more source

Pathwise solutions and attractors for retarded SPDEs with time smooth diffusion coefficients [PDF]

open access: yes, 2013
In this paper we study the longtime dynamics of mild solutions to retarded stochastic evolution systems driven by a Hilbert-valued Brownian motion. As a preparation for this purpose we have to show the existence and uniqueness of a cocycle solution of ...
Bessaih, Hakima   +2 more
core   +2 more sources

Diversity and complexity in neural organoids

open access: yesFEBS Letters, EarlyView.
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley   +1 more source

Home - About - Disclaimer - Privacy