Results 1  10
of
3,237,048
Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes
 J. COMP. PHYS
, 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract

Cited by 950 (2 self)
 Add to MetaCart
Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution
Partial Functions
"... this article we prove some auxiliary theorems and schemes related to the articles: [1] and [2]. MML Identifier: PARTFUN1. WWW: http://mizar.org/JFM/Vol1/partfun1.html The articles [4], [6], [3], [5], [7], [8], and [1] provide the notation and terminology for this paper. We adopt the following rules ..."
Abstract

Cited by 481 (10 self)
 Add to MetaCart
this article we prove some auxiliary theorems and schemes related to the articles: [1] and [2]. MML Identifier: PARTFUN1. WWW: http://mizar.org/JFM/Vol1/partfun1.html The articles [4], [6], [3], [5], [7], [8], and [1] provide the notation and terminology for this paper. We adopt the following
Consensus in the presence of partial synchrony
 JOURNAL OF THE ACM
, 1988
"... The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is a known fixed upper bound A on the time required for a message to be sent from one processor to ano ..."
Abstract

Cited by 508 (18 self)
 Add to MetaCart
to another and a known fixed upper bound (I, on the relative speeds of different processors. In an asynchronous system no fixed upper bounds A and (I, exist. In one version of partial synchrony, fixed bounds A and (I, exist, but they are not known a priori. The problem is to design protocols that work
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order differenti ..."
Abstract

Cited by 570 (6 self)
 Add to MetaCart
differential or difference equation, the forward and backward shift operator, the Rodriguestype formula and generating functions of all classes of orthogonal polynomials in this scheme. In chapter 2 we give the limit relations between different classes of orthogonal polynomials listed in the Askeyscheme
A comparative analysis of selection schemes used in genetic algorithms
 Foundations of Genetic Algorithms
, 1991
"... This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference or d ..."
Abstract

Cited by 513 (31 self)
 Add to MetaCart
This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference
Partial Constraint Satisfaction
, 1992
"... . A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem, in particular by satisfying ..."
Abstract

Cited by 465 (21 self)
 Add to MetaCart
a maximal number of constraints. Standard backtracking and local consistency techniques for solving constraint satisfaction problems can be adapted to cope with, and take advantage of, the differences between partial and complete constraint satisfaction. Extensive experimentation on maximal
A Transmission Control Scheme for Media Access in Sensor Networks
, 2001
"... We study the problem of media access control in the novel regime of sensor networks, where unique application behavior and tight constraints in computation power, storage, energy resources, and radio technology have shaped this design space to be very different from that found in traditional mobile ..."
Abstract

Cited by 473 (11 self)
 Add to MetaCart
We study the problem of media access control in the novel regime of sensor networks, where unique application behavior and tight constraints in computation power, storage, energy resources, and radio technology have shaped this design space to be very different from that found in traditional mobile
A modular threedimensional finitedifference groundwater flow model
 U.S. Geological Survey Techniques of WaterResources Investigations Book 6, Chapter A1
, 1988
"... The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation of groundwate ..."
Abstract

Cited by 485 (5 self)
 Add to MetaCart
of groundwater systems under various initial/boundary conditions and management schemes will be practiced. The emphasis of the student presentations will be based on published papers concerning the applied aspects of groundwater computer modeling utilizing finite difference and analytical computer models
Why Do Some Countries Produce So Much More Output Per Worker Than Others?
, 1998
"... Output per worker varies enormously across countries. Why? On an accounting basis, our analysis shows that differences in physical capital and educational attainment can only partially explain the variation in output per worker — we find a large amount of variation in the level of the Solow residual ..."
Abstract

Cited by 2368 (22 self)
 Add to MetaCart
Output per worker varies enormously across countries. Why? On an accounting basis, our analysis shows that differences in physical capital and educational attainment can only partially explain the variation in output per worker — we find a large amount of variation in the level of the Solow
Cooperative strategies and capacity theorems for relay networks
 IEEE TRANS. INFORM. THEORY
, 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decodeandforward the source message to the destination, or they compressandforward their channel outputs to the destination. The decodeandforward scheme is a variant of ..."
Abstract

Cited by 725 (19 self)
 Add to MetaCart
Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decodeandforward the source message to the destination, or they compressandforward their channel outputs to the destination. The decodeandforward scheme is a variant
Results 1  10
of
3,237,048