UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D

Theoretical computer science, 2021-06, Vol.872, p.55-78

2021

Volltextzugriff (PDF)

Proving new directed tile complexity lower bounds at temperature 1 by folding between 2D and just-barely 3D self-assembly

Natural computing, 2024-03

2024

Volltextzugriff (PDF)

Lifelong Planning A

Artificial intelligence, 2004-05, Vol.155 (1), p.93-146

2004

Volltextzugriff (PDF)

Congruences for ℓ-regular partition functions modulo 3

The Ramanujan journal, 2012, Vol.27 (1), p.101-108

2012

Volltextzugriff (PDF)

Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D

Theory of computing systems, 2023-10, Vol.67 (5), p.1082-1130

2023

Volltextzugriff (PDF)

Optimal Self-Assembly of Finite Shapes at Temperature 1 in 3D

Algorithmica, 2018-06, Vol.80 (6), p.1909-1963

2018

Volltextzugriff (PDF)

On the effects of hierarchical self-assembly for reducing program-size complexity

Theoretical computer science, 2021-11, Vol.894, p.50-78

2021

Volltextzugriff (PDF)

Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D

Algorithmica, 2017-04, Vol.77 (4), p.1240-1282

2017

Volltextzugriff (PDF)

Scaled pier fractals do not strictly self-assemble

Natural computing, 2017-06, Vol.16 (2), p.317-338

2017

Volltextzugriff (PDF)

New Bounds on the Tile Complexity of Thin Rectangles at Temperature-1

DNA Computing and Molecular Programming, 2019, p.100-119

2019

Volltextzugriff (PDF)

Optimal Self-assembly of Finite Shapes at Temperature 1 in 3D

Combinatorial Optimization and Applications, 2015, p.138-151

2015

Volltextzugriff (PDF)

Maximizing over multiple pattern databases speeds up heuristic search

Artificial intelligence, 2006-11, Vol.170 (16), p.1123-1136

2006

Volltextzugriff (PDF)

Incremental Heuristic Search in AI

The AI magazine, 2004-07, Vol.25 (2), p.99-112

2004

Volltextzugriff (PDF)

Optimal Program-Size Complexity for Self-Assembly at Temperature 1 in 3D

DNA Computing and Molecular Programming, 2015, Vol.9211, p.71-86

2015

Volltextzugriff (PDF)

Scaled Tree Fractals Do not Strictly Self-assemble

Unconventional Computation and Natural Computation, 2014, Vol.8553, p.27-39

2014

Volltextzugriff (PDF)

Maximizing over multiple pattem databases speeds up heuristic search

Artificial intelligence, 2006, Vol.170 (16-17), p.1123-1136

2006

Volltextzugriff (PDF)

Tight Bounds on the Directed Tile Complexity of a Just-Barely 3D 2×N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2 \times N$$\end{document} Rectangle at Temperature 1

Unconventional Computation and Natural Computation, 2023, p.79-93

2023

Volltextzugriff (PDF)

Using and Learning Abstraction Hierarchies for Planning: Research Summary

Abstraction, Reformulation, and Approximation, 2000, p.320-321

2000

Volltextzugriff (PDF)

AAAI 2008 Workshop Reports

The AI magazine, 2009, Vol.30 (1), p.108-118

2009

Volltextzugriff (PDF)

Speeding up the convergence of online heuristic search and scaling up offline heuristic search

Furcy, David A

2004

Volltextzugriff (PDF)

Designing Effective Heterogeneous Teams for Multiagent Routing Domains

2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology, 2011, Vol.2, p.341-348

2011

Volltextzugriff (PDF)

Sorting out sorting: the sequel

Proceedings of the 13th annual conference on Innovation and technology in computer science education, 2008, p.174-178

2008

Volltextzugriff (PDF)

Sorting out sorting: the sequel

SIGCSE bulletin, 2008-08, Vol.40 (3), p.174-178

2008

Volltextzugriff (PDF)

Speeding up the calculation of heuristics for heuristic search-based planning

Eighteenth national conference on Artificial intelligence, 2002, p.484-491

2002

Volltextzugriff (PDF)

The use of areas under curves in diabetes research

Diabetes care, 1995-02, Vol.18 (2), p.245-250

1995

Volltextzugriff (PDF)

1 – 25 von 26

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(20)
Mit Volltextzugriff
(24)

Publikationsform

Sprache

Englisch
(26)

Erscheinungsjahr

n.n

Zeitschrift / Serie

5 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D

Proving new directed tile complexity lower bounds at temperature 1 by folding between 2D and just-barely 3D self-assembly

Lifelong Planning A

Congruences for ℓ-regular partition functions modulo 3

Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D

Optimal Self-Assembly of Finite Shapes at Temperature 1 in 3D

On the effects of hierarchical self-assembly for reducing program-size complexity

Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D

Scaled pier fractals do not strictly self-assemble

New Bounds on the Tile Complexity of Thin Rectangles at Temperature-1

Optimal Self-assembly of Finite Shapes at Temperature 1 in 3D

Maximizing over multiple pattern databases speeds up heuristic search

Incremental Heuristic Search in AI

Optimal Program-Size Complexity for Self-Assembly at Temperature 1 in 3D

Scaled Tree Fractals Do not Strictly Self-assemble

Maximizing over multiple pattem databases speeds up heuristic search

Using and Learning Abstraction Hierarchies for Planning: Research Summary

AAAI 2008 Workshop Reports

Speeding up the convergence of online heuristic search and scaling up offline heuristic search

Designing Effective Heterogeneous Teams for Multiagent Routing Domains

Sorting out sorting: the sequel

Sorting out sorting: the sequel

Speeding up the calculation of heuristics for heuristic search-based planning

The use of areas under curves in diabetes research

Suchergebnisse filtern