[BUCH][B] Artificial superintelligence: a futuristic approach

RV Yampolskiy - 2015 - books.google.com
This book is designed to become a foundational text for the new science of AI safety
engineering. While specific predictions regarding the consequences of an intelligence …

Dynamic optimization and heuristics based online coverage path planning in 3D environment for UAVs

AG Melo, MF Pinto, ALM Marcato, LM Honório… - Sensors, 2021 - mdpi.com
Path planning is one of the most important issues in the robotics field, being applied in many
domains ranging from aerospace technology and military tasks to manufacturing and …

On the hardness of reoptimization

HJ Böckenhauer, J Hromkovič, T Mömke… - SOFSEM 2008: Theory …, 2008 - Springer
We consider the following reoptimization scenario: Given an instance of an optimization
problem together with an optimal solution, we want to find a high-quality solution for a locally …

Complexity and approximation in reoptimization

G Ausiello, V Bonifaci, B Escoffier - … and Logic in the Real World, 2011 - World Scientific
In this chapter the following model is considered: We assume that an instance I of a
computationally hard optimization problem has been solved and that we know the optimum …

Activity‐based travel scenario analysis with routing problem reoptimization

JYJ Chow - Computer‐Aided Civil and Infrastructure …, 2014 - Wiley Online Library
Activity‐based travel scenario analysis and network design using a household activity
pattern problem (HAPP) can face significant computational cost and inefficiency. One …

On the limits of recursively self-improving AGI

RV Yampolskiy - … General Intelligence: 8th International Conference, AGI …, 2015 - Springer
Self-improving software has been a goal of computer scientists since the founding of the
field of Artificial Intelligence. In this work we analyze limits on computation which might …

From seed AI to technological singularity via recursively self-improving software

RV Yampolskiy - arxiv preprint arxiv:1502.06512, 2015 - arxiv.org
Software capable of improving itself has been a dream of computer scientists since the
inception of the field. In this work we provide definitions for Recursively Self-Improving …

Simple and fast reoptimizations for the Steiner tree problem

B Escoffier, M Milanič, VT Paschos - Algorithmic Operations Research, 2009 - erudit.org
We address reoptimization issues for the Steiner tree problem. We assume that an optimal
solution is given for some instance of the problem and the objective is to maintain a good …

Reoptimization of the shortest common superstring problem

D Bilò, HJ Böckenhauer, D Komm, R Královič… - Algorithmica, 2011 - Springer
A reoptimization problem describes the following scenario: given an instance of an
optimization problem together with an optimal solution for it, we want to find a good solution …

Reoptimization of Steiner trees: Changing the terminal set

HJ Böckenhauer, J Hromkovič, R Královič… - Theoretical computer …, 2009 - Elsevier
Given an instance of the Steiner tree problem together with an optimal solution, we consider
the scenario where this instance is modified locally by adding one of the vertices to the …