Results 1  10
of
149,301
Optimal RunTime Tracing of MessagePassing Programs
"... The widespread adoption of distributed computing has accentuated the need for an effective set of support tools to facilitate debugging and monitoring of distributed programs. Unfortunately for distributed programs, this is not a trivial task. Many distributed programs are inherently nondeterminist ..."
Abstract
 Add to MetaCart
of a message passing program and present a simple proof that it is impossible to have an algorithm, which will produce an optimal message trace (least number on messages traced), in general. We then present two tracing algorithms, Algorithm A and Algorithm B. Both the algorithms trace messages at runtime
Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time
 234 I. Chabini. Minimum expected travel times in stochastic timedependent networks revisited. Internal Report. MIT
, 1999
"... A solution is provided for what appears to be a 30yearold problem dealing with the discovery of the most efficient algorithms possible to compute alltoone shortest paths in discrete dynamic networks. This problem lies at the heart of efficient solution approaches to dynamic network models that a ..."
Abstract

Cited by 78 (2 self)
 Add to MetaCart
is established, and solution algorithms optimal for run time are developed. A new and simple solution algorithm is proposed for alltoone, all departure time intervals, shortest paths problems. It is proved, theoretically, that the new solution algorithm has an optimal run time complexity that equals
A SelfOptimizing RunTime Architecture for Configurable Dependability of Services
 Architecting Dependable Systems II, volume 3069 of Lecture
"... Abstract. Many human activities today depend critically on systems where substantial functionality has been realized using complex software. Therefore, appropriate means to achieve a sufficient degree for dependability are required, which use the available information about the software components a ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
Abstract. Many human activities today depend critically on systems where substantial functionality has been realized using complex software. Therefore, appropriate means to achieve a sufficient degree for dependability are required, which use the available information about the software components and the system architecture. For the special case of servicebased architectures, we identify in this paper a set of architectural principles which can be used to improve dependability. We then describe how the identified architectural principles have been used in a realized servicebased architecture which extends Jini. The dependable operation of the infrastructure services of the architecture further enables to systematically control and configure some dependability attributes of application services. We present a qualitative and quantitative evaluation of the dependability for a configuration of multiple identical services which are executed with the architecture and show how the different parameters effect the dependability. Additionally, a scheme for the dynamic control of the required dependability of the application services in the case of changing failure characteristics of the environment is outlined. Finally, we present a first evaluation of the developed architecture and its dynamic control of dependability. 1
Parallel Genetic Algorithm for Optimizing Runtime Reconfigurable Circuits
"... In this paper a methodology for finding the maximal common subgraph of two directed graphs with parallel genetic algorithm is discussed. The method is directly applicable to the optimization of configurations of FPGA (Field Programmable Gate Array) circuits in RunTime Reconfigurable systems. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper a methodology for finding the maximal common subgraph of two directed graphs with parallel genetic algorithm is discussed. The method is directly applicable to the optimization of configurations of FPGA (Field Programmable Gate Array) circuits in RunTime Reconfigurable systems.
Optimal run time for EMQ model with backordering, failureinrework and breakdown happening in stockpiling time
 WSEAS Transactions on Information Science & Applications
"... Abstract: This study examines the optimal run time for the economic manufacturing quantity (EMQ) model with failureinwork, backlogging, and random breakdown happening in stockpiling time. A recent article by Chiu and Chiu [Mathematical modeling for production system with backlogging and failure ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: This study examines the optimal run time for the economic manufacturing quantity (EMQ) model with failureinwork, backlogging, and random breakdown happening in stockpiling time. A recent article by Chiu and Chiu [Mathematical modeling for production system with backlogging and failure
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
time and all other standard heap operations in o ( 1) amortized time. Using Fheaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain the following worstcase bounds, where n is the number of vertices and m the number of edges
A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
 COMBINATORICA
, 1984
"... We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract

Cited by 860 (3 self)
 Add to MetaCart
We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than
A Learning Algorithm for Continually Running Fully Recurrent Neural Networks
, 1989
"... The exact form of a gradientfollowing learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks. These algorithms have: (1) the advantage that they do not require a precis ..."
Abstract

Cited by 534 (4 self)
 Add to MetaCart
The exact form of a gradientfollowing learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks. These algorithms have: (1) the advantage that they do not require a
Risks for the long run: A potential resolution of asset pricing puzzles
 JOURNAL OF FINANCE
, 1994
"... We model consumption and dividend growth rates as containing (i) a small longrun predictable component and (ii) fluctuating economic uncertainty (consumption volatility). These dynamics, for which we provide empirical support, in conjunction with Epstein and Zin’s (1989) preferences, can explain ke ..."
Abstract

Cited by 761 (63 self)
 Add to MetaCart
We model consumption and dividend growth rates as containing (i) a small longrun predictable component and (ii) fluctuating economic uncertainty (consumption volatility). These dynamics, for which we provide empirical support, in conjunction with Epstein and Zin’s (1989) preferences, can explain
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
issues addressed include timevarying optimization problems and a priori “headtohead” minimax distinctions between optimization algorithms, distinctions that result despite the NFL theorems’ enforcing of a type of uniformity over all algorithms.
Results 1  10
of
149,301