Results 71 to 80 of about 335,404 (286)

AutomataGPT: Transformer‐Based Forecasting and Ruleset Inference for Two‐Dimensional Cellular Automata

open access: yesAdvanced Science, EarlyView.
We introduce AutomataGPT, a generative pretrained transformer (GPT) trained on synthetic spatiotemporal data from 2D cellular automata to learn symbolic rules. Demonstrating strong performance on both forward and inverse tasks, AutomataGPT establishes a scalable, domain‐agnostic framework for interpretable modeling, paving the way for future ...
Jaime A. Berkovich   +2 more
wiley   +1 more source

Near-Optimal BRL using Optimistic Local Transitions [PDF]

open access: yes, 2012
Model-based Bayesian Reinforcement Learning (BRL) allows a found formalization of the problem of acting optimally while facing an unknown environment, i.e., avoiding the exploration-exploitation dilemma.
Araya, Mauricio   +2 more
core   +2 more sources

Consensus Formation and Change are Enhanced by Neutrality

open access: yesAdvanced Science, EarlyView.
Neutral agents are shown to enhance both the formation and overturning of consensus in collective decision‐making. A general mathematical model and experiments with locusts and humans reveal that neutrality enables robust consensus via simple interactions and accelerates consensus change by reducing effective population size.
Andrei Sontag   +3 more
wiley   +1 more source

Heuristic recurrent algorithms for photonic Ising machines

open access: yesNature Communications, 2020
Application-specific computational hardware helps to solve the limitations of conventional electronics in solving difficult calculation problems. Here the authors present a general heuristic algorithm to solve NP-Hard Ising problems in a photonics ...
Charles Roques-Carmes   +12 more
doaj   +1 more source

Heuristics, Advanced Heuristics or Optimal Algorithm

open access: yesStrojniški vestnik, 2004
The order-picking, process of retrieving items from storage locations in response to a specific customer request, is the most laborious and the most costly activity in a typical warehouse. As the 50% of total order picking time is spent on traveling, reducing travel distances is one of a warehouse designers' objectives.
Oluić, Čedomir, Đukić, Goran
openaire  

In Situ Characterisation of Hydrogels via Dynamic Interface Printing

open access: yesAdvanced Science, EarlyView.
ABSTRACT Hydrogels have become pivotal materials for tissue engineering, robotics, biomedical devices, and sensing applications due to their diverse material compositions and tunable mechanical properties. While significant effort has focused on developing novel manufacturing approaches such as extrusion bioprinting and light‐based fabrication methods,
Callum Vidler   +2 more
wiley   +1 more source

Structural Eigenmodes of the Brain to Improve the Source Localization of EEG: Application to Epileptiform Activity

open access: yesAdvanced Science, EarlyView.
Geometry and connectivity are complementary structures, which have demonstrated their ability to represent the brain's functional activity. This study evaluates geometric and connectome eigenmodes as biologically informed constraints for EEG source localization.
Pok Him Siu   +6 more
wiley   +1 more source

Determination with Linear Form of Turkey's Energy Demand Forecasting by the Tree Seed Algorithm and the Modified Tree Seed Algorithm

open access: yesAdvances in Electrical and Computer Engineering, 2020
Energy plays an important role in every stage of human life in different forms and variations. Along with the developments in economic, social and industrial fields, the amount of energy that countries need is increasing day by day.
BESKIRLI, A., TEMURTAS, H., OZDEMIR, D.
doaj   +1 more source

Heuristic Backtracking Algorithms for SAT

open access: yes, 2003
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of formal verification, and also motivated the development of many new ...
Bhalla, A.   +3 more
core   +3 more sources

Heuristic algorithms for the Longest Filled Common Subsequence Problem

open access: yes, 2019
At CPM 2017, Castelli et al. define and study a new variant of the Longest Common Subsequence Problem, termed the Longest Filled Common Subsequence Problem (LFCS).
Mincu, Radu Stefan, Popa, Alexandru
core   +1 more source

Home - About - Disclaimer - Privacy