scholarly journals Averaging algorithms and distributed anonymous discrete function computation

2011 ◽  
Author(s):  
John N. Tsitsiklis
Keyword(s):  
Discrete Function ◽  
Function Computation

scholarly journals Distributed Anonymous Discrete Function Computation

2011 ◽  
Vol 56 (10) ◽  
pp. 2276-2289 ◽  
Author(s):  
Julien M. Hendrickx ◽  
Alex Olshevsky ◽  
John N. Tsitsiklis
Keyword(s):  
Discrete Function ◽  
Function Computation

scholarly journals Permanence and Positive Periodic Solutions of a Discrete Delay Competitive System

2010 ◽  
Vol 2010 ◽  
pp. 1-22 ◽  
Author(s):  
Wenjie Qin ◽  
Zhijun Liu
Keyword(s):  
Periodic Solutions ◽  
Global Attractivity ◽  
Sufficient Conditions ◽  
Coincidence Degree ◽  
Degree Theory ◽  
Discrete Delay ◽  
Positive Periodic Solutions ◽  
Competitive System ◽  
Discrete Function ◽  
Species Population

A discrete time non-autonomous two-species competitive system with delays is proposed, which involves the influence of many generations on the density of species population. Sufficient conditions for permanence of the system are given. When the system is periodic, by using the continuous theorem of coincidence degree theory and constructing a suitable Lyapunov discrete function, sufficient conditions which guarantee the existence and global attractivity of positive periodic solutions are obtained. As an application, examples and their numerical simulations are presented to illustrate the feasibility of our main results.

scholarly journals BEAR-FP: A ROBUST FRAMEWORK FOR FLOORPLANNING

1992 ◽  
Vol 03 (01) ◽  
pp. 137-170 ◽  
Author(s):  
MASSOUD PEDRAM ◽  
ERNEST S. KUH
Keyword(s):  
Shape Function ◽  
Optimization Procedure ◽  
University Of California ◽  
Global Routing ◽  
Top Down ◽  
Function Computation ◽  
Wide Range ◽  
The University ◽  
Linear Assignment ◽  
Selection Of

This paper presents a hierarchical floorplanning approach for macrocell layouts which is based on the bottom-up clustering, shape function computation, and top-down floorplan optimization with integrated global routing and pin assignment. This approach provides means for specifying and techniques for satisfying a wide range of constraints (physical, topological, timing) and is, therefore, able to generate floorplans for a number of different layout styles. A systematic and efficient optimization procedure during the selection of suitable floorplan patterns that integrates floorplanning, global routing and pin assignment, a new pin assignment technique based on linear assignment and driven by the global routing solution and floorplan topology, and an effective timing-driven floorplanning scheme are among the other novel features of the floorplanner. These techniques have been incorporated in BEAR-FP, a macrocell layout system developed at the University of California, Berkeley. Results on various placement and floorplanning benchmarks are quite good.

Sign in / Sign up

Export Citation Format

Share Document