Results 201 to 210 of about 4,448,600 (255)
Advances in Bio‐Integrated Edge Computing Systems for Smart and Connected Health
Advanced Materials, EarlyView.This review explores advances in bio‐integrated edge computing for healthcare, focusing on co‐designing computing, sensing, and energy strategies to overcome integration and power challenges for optimized, decentralized operation. ABSTRACT Recent advances in bio‐integrated healthcare technologies have enabled continuous, high‐resolution monitoring and ...
Gyuwon Kim +4 more
wiley +1 more source
A Simple Descriptor for Solid‐State Ionic Conductors Across Chemistries
Advanced Materials, EarlyView.Researchers develop a simple and transferable descriptor, distance contraction, for solid‐state ion migration across Li‐, Na‐, K‐, and Mg‐ion conductors and diverse anion chemistries. By capturing the maximum local contraction experienced by the migrating ion, the descriptor enables rapid materials screening and unifies diverse ion‐transport mechanisms.
Ramanuja Srinivasan Saravanan +4 more
wiley +1 more source
Advanced Materials Interfaces, EarlyView.A pyrenylated donor–acceptor probe exhibits environment‐dependent fluorescence governed by intramolecular charge transfer, restricted molecular motion, and supramolecular organization. Nonlinear regression accurately reconstructs fluorescence responses to viscosity, temperature, concentration, and pH, while correlated parameter maps reveal hidden ...
Harshal V. Barkale +2 more
wiley +1 more source
Advanced Materials Interfaces, EarlyView.By analyzing the thermal‐mechanical properties and molecular‐scale interactions in polyacrylamide (PAAM) hydrogels, this research demonstrates a rubber‐glass‐crystal phase transition under the combined stimuli of temperature and moisture. Because of these hybrid phase transitions, PAAM hydrogels exhibit shape memory behavior in thermal and moist ...
Shuai Xu +7 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Minimization by Random Search Techniques
Mathematics of Operations Research, 1981We give two general convergence proofs for random search algorithms. We review the literature and show how our results extend those available for specific variants of the conceptual algorithm studied here. We then exploit the convergence results to examine convergence rates and to actually design implementable methods.
Francisco J Solis, Roger J -B Wets
exaly +3 more sources
SIAM Journal on Optimization, 2004
Summary: A new variant of pure random search (PRS) for function optimization is introduced. The basic finite-descent accelerated random search (ARS) algorithm is simple: the search is confined to shrinking neighborhoods of a previous record-generating value, with the search neighborhood reinitialized to the entire space when a new record is found ...
M. J. Appel, R. LaBarre, D. Radulovic
exaly +3 more sources
Summary: A new variant of pure random search (PRS) for function optimization is introduced. The basic finite-descent accelerated random search (ARS) algorithm is simple: the search is confined to shrinking neighborhoods of a previous record-generating value, with the search neighborhood reinitialized to the entire space when a new record is found ...
M. J. Appel, R. LaBarre, D. Radulovic
exaly +3 more sources
A parallel algorithm for random searches
Computer Physics Communications, 2015Abstract We discuss a parallelization procedure for a two-dimensional random search of a single individual, a typical sequential process. To assure the same features of the sequential random search in the parallel version, we analyze the former spatial patterns of the encountered targets for different search strategies and densities of homogeneously ...
G M Viswanathan, M G E da Luz
exaly +3 more sources
Continuous functions minimization by dynamic random search technique
Applied Mathematical Modelling, 2007 Random search technique is the simplest one of the heuristic algorithms. It is stated in the literature that the probability of finding global minimum is equal to 1 by using the basic random search technique, but it takes too much time to reach the ...
Coşkun HAMZAÇEBİ, Fevzi Kutay
exaly +2 more sources
30th Annual Symposium on Foundations of Computer Science, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire +1 more source
IEEE Transactions on Computers, 1972
A random search technique for function minimization is proposed that incorporates the step-size and direction adaptivity of Hooke and Jeeves' [1] pattern search. Experimental results for a variety of functions indicate that the random pattern search is more effective than the corresponding deterministic method for a class of problems with hard ...
J. P. Lawrence, Kenneth Steiglitz
openaire +3 more sources
A random search technique for function minimization is proposed that incorporates the step-size and direction adaptivity of Hooke and Jeeves' [1] pattern search. Experimental results for a variety of functions indicate that the random pattern search is more effective than the corresponding deterministic method for a class of problems with hard ...
J. P. Lawrence, Kenneth Steiglitz
openaire +3 more sources