Results 1  10
of
105,861
FIXED/FREE FINAL TIME SIR EPIDEMIC MODELS WITH MULTIPLE CONTROLS
"... In this paper the possible advantages in introducing multiple controls in the analysis of epidemic models are investigated. Usually, only the susceptible or infected people are controlled by vaccination or by quarantine and/or medicine treatment; in this paper multiple controls, both for the suscept ..."
Abstract
 Add to MetaCart
for the susceptible and infected are considered. The problem is studied both in the case of fixed and free final time. Numerical results are considered for simulated data showing the effects of multiple controls and the rule of each parameters of the model. Also a simulation on real data regarding the course
Second Order Sufficient Conditions for Optimal Control Problems with Free Final Time: The Riccati Approach
, 2000
"... Second order sufficient conditions (SSC) for control problems with controlstate constraints and free final time are presented. Instead of deriving such SSC de initio, the control problem with free final time is tranformed into an augmented control problem with fixed final time for which wellknown ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
Second order sufficient conditions (SSC) for control problems with controlstate constraints and free final time are presented. Instead of deriving such SSC de initio, the control problem with free final time is tranformed into an augmented control problem with fixed final time for which well
Optimal Birth Control of Population Dynamics. II. Problems with Free Final Time, Phase Constraints, and MiniMax Costs*
, 1988
"... We study optimal birth control of population systems of McKendrick type which is a distributed parameter system involving first order partial differential equations with nonlocal bilinear boundary control. New results on problems with free final time, phase constraints, and minimax costs are presen ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study optimal birth control of population systems of McKendrick type which is a distributed parameter system involving first order partial differential equations with nonlocal bilinear boundary control. New results on problems with free final time, phase constraints, and minimax costs
Semantics of ContextFree Languages
 In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract

Cited by 569 (0 self)
 Add to MetaCart
"Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications
No Free Lunch Theorems for Optimization
, 1997
"... A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A number of “no free lunch ” (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performan ..."
Abstract

Cited by 961 (10 self)
 Add to MetaCart
A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A number of “no free lunch ” (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset
An Efficient ContextFree Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract

Cited by 798 (0 self)
 Add to MetaCart
A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general
Epidemic Spreading in ScaleFree Networks
, 2000
"... The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scalefree networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from c ..."
Abstract

Cited by 575 (15 self)
 Add to MetaCart
The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scalefree networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from
Time Varying World Market Integration
 JOURNAL OF FINANCE
, 1995
"... We propose a measure of capital market integration arising from a conditional regimeswitching model. Our measure allows us to describe expected returns in countries that are segmented from world capital markets in one part of the sample and become integrated later in the sample. We find that a numb ..."
Abstract

Cited by 546 (40 self)
 Add to MetaCart
number of emerging markets exhibit timevarying integration. Some markets appear more integrated than one might expect based on prior knowledge of investment restrictions. Other markets appear segmented even though foreigners have relatively free access to their capital markets. While there is a
Constructing Free Energy Approximations and Generalized Belief Propagation Algorithms
 IEEE Transactions on Information Theory
, 2005
"... Important inference problems in statistical physics, computer vision, errorcorrecting coding theory, and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs. The belief propagation (BP) algorithm is an efficient way to solve these problems t ..."
Abstract

Cited by 585 (13 self)
 Add to MetaCart
that is exact when the factor graph is a tree, but only approximate when the factor graph has cycles. We show that BP fixed points correspond to the stationary points of the Bethe approximation of the free energy for a factor graph. We explain how to obtain regionbased free energy approximations that improve
RangeFree Localization Schemes for Large Scale Sensor Networks
, 2003
"... Wireless Sensor Networks have been proposed for a multitude of locationdependent applications. For such systems, the cost and limitations of hardware on sensing nodes prevent the use of rangebased localization schemes that depend on absolute pointtopoint distance estimates. Because coarse accura ..."
Abstract

Cited by 525 (8 self)
 Add to MetaCart
accuracy is sufficient for most sensor network applications, solutions in rangefree localization are being pursued as a costeffective alternative to more expensive rangebased approaches. In this paper, we present APIT, a novel localization algorithm that is rangefree. We show that our APIT scheme
Results 1  10
of
105,861