Results 51 to 60 of about 812,236 (286)
Rigorous numerics for nonlinear operators with tridiagonal dominant linear part [PDF]
, 2015 We present a method designed for computing solutions of infinite dimensional non linear operators $f(x) = 0$ with a tridiagonal dominant linear part. We recast the operator equation into an equivalent Newton-like equation $x = T(x) = x - Af(x)$, where $A$
Breden, Maxime +2 more
core +2 more sources
Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization [PDF]
, 2015 Dual decomposition has been successfully employed in a variety of distributed convex optimization problems solved by a network of computing and communicating nodes.
Jamali-Rad, Hadi, Simonetto, Andrea
core +2 more sources
ABCpy: A High-Performance Computing Perspective to Approximate Bayesian Computation
Journal of Statistical Software, 2021 ABCpy is a highly modular scientific library for approximate Bayesian computation (ABC) written in Python. The main contribution of this paper is to document a software engineering effort that enables domain scientists to easily apply ABC to their ...
Ritabrata Dutta +7 more
doaj +1 more source
Termination Criteria for Solving Concurrent Safety and Reachability Games [PDF]
, 2008 We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state.
Chatterjee, Krishnendu +2 more
core +4 more sources
A Low-Power and High-Accuracy Approximate Multiplier With Reconfigurable Truncation
IEEE Access, 2022 Multipliers are among the most critical arithmetic functional units in many applications, and those applications commonly require many multiplications which result in significant power consumption. For applications that have error tolerance, employing an
Fang-Yi Gu, Ing-Chao Lin, Jia-Wei Lin
doaj +1 more source
Computing Approximate Nash Equilibria in Polymatrix Games
, 2014 In an $\epsilon$-Nash equilibrium, a player can gain at most $\epsilon$ by unilaterally changing his behaviour. For two-player (bimatrix) games with payoffs in $[0,1]$, the best-known$\epsilon$ achievable in polynomial time is 0.3393. In general, for $n$-
Deligkas, Argyrios +3 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
Approximate Networking for Universal Internet Access
Future Internet, 2017 Despite the best efforts of networking researchers and practitioners, an ideal Internet experience is inaccessible to an overwhelming majority of people the world over, mainly due to the lack of cost-efficient ways of provisioning high-performance ...
Junaid Qadir +5 more
doaj +1 more source
An Approximate GEMM Unit for Energy-Efficient Object Detection
Sensors, 2021 Edge computing brings artificial intelligence algorithms and graphics processing units closer to data sources, making autonomy and energy-efficient processing vital for their design.
Ratko Pilipović +4 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Oral mucositis is a common and debilitating side effect of childhood cancer and stem cell transplant treatments. It affects the quality of life of children and young people (CYP) and places a strain on services. Photobiomodulation is recommended for oral mucositis prevention in international guidance but is poorly implemented in UK ...
Claudia Heggie +4 more
wiley +1 more source