Results 91 to 100 of about 335,404 (286)
Interactive Heuristic Search Algorithm [PDF]
, 2002 We present a hybrid heuristic search algorithm for constraint satisfaction problems, which was proposed as a mixture of two basic approaches: local search and backtrack based search. One of its major advantages is interactive behaviour in the sense of changing the task during the search. Some results are presented using the well known n-queens problem.
openaire +1 more source
PAIR: Reconstructing Single‐Cell Open‐Chromatin Landscapes for Transcription Factor Regulome Mapping
Advanced Science, EarlyView.scATAC‐seq analysis is often constrained by limited sequencing depth, extreme sparsity, and pervasive technical missingness. PAIR is a probabilistic framework that restores scATAC‐seq accessibility profiles by directly modeling the native cell–peak bipartite structure of chromatin accessibility.
Yanchi Su +7 more
wiley +1 more source
An Atypical Survey of Typical-Case Heuristic Algorithms
, 2012 Heuristic approaches often do so well that they seem to pretty much always give the right answer. How close can heuristic algorithms get to always giving the right answer, without inducing seismic complexity-theoretic consequences?
Hemaspaandra, Lane A., Williams, Ryan
core
Bottleneck-based heuristic for permutation flowshop scheduling [PDF]
, 2017 The newly heuristic is developed by introducing the bottleneck-based concept that was applied at the beginning of initial solution determination. The heuristic is known as Bottleneck-Based (BNB) heuristic.
Isa, Noor Amira
core
Advanced Science, EarlyView.ABSTRACT The multifunctional integration of chips with high flexibility and scalable manufacturing is crucial for enhancing chip performance, reducing chip size, and simplifying chip design. However, balancing volume, cost, flexibility, and functionality using traditional heterogeneous integration methods is challenging.
Lang Chen +7 more
wiley +1 more source
Intelligent perturbation algorithms for space scheduling optimization [PDF]
Intelligent perturbation algorithms for space scheduling optimization are presented in the form of the viewgraphs. The following subject areas are covered: optimization of planning, scheduling, and manifesting; searching a discrete configuration space ...
Kurtzman, Clifford R.
core +1 more source
Engineering Neuronal Network Connectivity Through Precise and Scalable Electrical Modulation
Advanced Science, EarlyView.This study presents a scalable all‐electrical method for precise neuronal‐circuit reconfiguration based on high‐density microelectrode arrays. By employing biologically inspired plasticity rules, targeted connectivity changes were successfully induced and quantified across diverse neuronal preparations.
Sreedhar S. Kumar +10 more
wiley +1 more source
Heuristic Clustering Algorithms in Ad hoc Networks
Emerging Markets Journal, 2014 The clustering allows dividing the geographical region to be covered into small zones in which each zone can be handled with a powerful node called clusterhead.
Nevin Aydın
doaj +1 more source
Multipoint-to-multipoint network communication [PDF]
, 2009 We have formulated an exact ILP model for the problem of communicating on a virtual network. While this ILP model was successful in solving small problems, it is not recommended to handle larger instances, due to the fact that the number of variables in ...
Kilby, Philip +2 more
core
Advanced Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source