Results 1  10
of
933,759
An adaptive finite element algorithm with reliable and efficient error control for linear parabolic problems
 Math. Comp
"... An ecient and reliable a posteriori error estimate is derived for linear parabolic equations which does not depend on any regularity assumption on the underlying elliptic operator. An adaptive algorithm with variable timestep sizes and space meshes is proposed and studied which, at each time step, ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
An ecient and reliable a posteriori error estimate is derived for linear parabolic equations which does not depend on any regularity assumption on the underlying elliptic operator. An adaptive algorithm with variable timestep sizes and space meshes is proposed and studied which, at each time step
Adaptive finite element algorithms for the Stokes problem: Convergence rates and optimal computational complexity
, 2006
"... Abstract. Although adaptive finite element methods (FEMs) are recognized as powerful techniques for solving mixed variational problems of fluid mechanics, usually they are not even proven to converge. Only recently, in [SINUM, 40 (2002), pp.12071229] Bänsch, Morin and Nochetto introduced an adaptiv ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Uzawa finite element algorithm that uses a generalization of the optimal adaptive FEM of Stevenson [SINUM, 42 (2005), pp.21882217] as an inner solver. By adding a derefinement step to the resulting adaptive Uzawa algorithm, in order to optimize the underlying triangulation after each fixed number
Molecular Based Mathematical Biology Research Article • DOI: 10.2478/mlbmb20130005 • MBMB • 2012 • 90108 Parallel Adaptive Finite Element Algorithms for Solving the Coupled Electrodiffusion Equations
"... In this paper we present parallel adaptive finite element algorithms for solving the 3D electrodiffusion equations such as the PoissonNernstPlanck equations and the sizemodified PoissonNernstPlanck equations in simulations of biomolecular systems in ionic liquid. A set of transformation meth ..."
Abstract
 Add to MetaCart
In this paper we present parallel adaptive finite element algorithms for solving the 3D electrodiffusion equations such as the PoissonNernstPlanck equations and the sizemodified PoissonNernstPlanck equations in simulations of biomolecular systems in ionic liquid. A set of transformation
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
, 1997
"... We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporallyordered sequence of diffusing computations; each computat ..."
Abstract

Cited by 1095 (6 self)
 Add to MetaCart
" of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocol's high degree of adaptivity. This desirable behavior is achieved through the novel use of a "physical or logical clock" to establish the "
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
The Viterbi algorithm
 Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract

Cited by 985 (3 self)
 Add to MetaCart
vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A799A804, 1964. [9] T. C. Mo, “Theory of electrodynamics in media in noninertial frames and applications, ” J. Math. Phys., vol. 11, pp. 25892610, 1970.
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
A learning algorithm for Boltzmann machines
 Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract

Cited by 586 (13 self)
 Add to MetaCart
The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a
The CN2 Induction Algorithm
 MACHINE LEARNING
, 1989
"... Systems for inducing concept descriptions from examples are valuable tools for assisting in the task of knowledge acquisition for expert systems. This paper presents a description and empirical evaluation of a new induction system, cn2, designed for the efficient induction of simple, comprehensib ..."
Abstract

Cited by 884 (6 self)
 Add to MetaCart
, comprehensible production rules in domains where problems of poor description language and/or noise may be present. Implementations of the cn2, id3 and aq algorithms are compared on three medical classification tasks.
Randomized Algorithms
, 1995
"... Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available, or the simp ..."
Abstract

Cited by 2210 (37 self)
 Add to MetaCart
Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available
Results 1  10
of
933,759