Results 241 to 250 of about 22,969,801 (317)
Some of the next articles are maybe not open access.

Algorithm = logic + control

Communications of the ACM, 1979
The notion that computation = controlled deduction was first proposed by Pay Hayes [19] and more recently by Bibel [2] and Vaughn-Pratt [31]. A similar thesis that database systems should be regarded as consisting of a relational component, which defines the logic of the data, and a control component, which stores and retrieves it, has been ...
openaire   +2 more sources

Binomial congestion control algorithms

Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2002
This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in transmission rate upon each congestion indication (or loss) is problematic. Binomial algorithms generalize TCP-style additive-increase
Deepak Bansal, Hari Balakrishnan
openaire   +1 more source

A Comparison of Control Algorithms for DSTATCOM

IEEE Transactions on Industrial Electronics, 2009
In this paper, a Distribution STATic COMpensator (DSTATCOM) is proposed for compensation of reactive power and unbalance caused by various loads in distribution system. An evaluation of three different methods is made to derive reference currents for a DSTATCOM.
Bhim Singh 0001, Jitendra Solanki
openaire   +1 more source

Evolutional algorithm in stock control

Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems, 2011
Evolutional algorithms are an excellent optimization tool performing well in such tasks where classic methods have no use. In this thesis the use of those algorithms in stock control was presented for the problem of stochastic function of cost criterion. Such functions are used in case of random demand with a constant delivery period.
Katarzyna Jakowska-Suwalska   +2 more
openaire   +1 more source

An algorithm for control memory minimization

Proceedings of the 8th annual workshop on Microprogramming - MICRO 8, 1975
This paper presents a procedure for determining the minimum number of microinstructions of a given bit length B required to code a microprogram. The procedure is applied to different values of B to determine the optimal method of implementing the microprogram in the control memory of a digital computer.
Masahiro Tsuchiya, T. Jacobson
openaire   +1 more source

A Symbiosis Algorithm for Robotic Control

2005 IEEE Congress on Evolutionary Computation, 2005
An algorithm inspired by the biological phenomenon of symbiosis is presented in this paper. The genetic diversity obtained from the creation of symbiotic relationships is investigated and the symbiosis algorithm is applied to a robotic forward kinematics control problem.
K. M. Ward   +3 more
openaire   +1 more source

A Congestion Control Algorithm for Datacenters

2013 IEEE Eighth International Conference on Networking, Architecture and Storage, 2013
Recently, there has been renewed interest in latency as a primary metric for mainstream data center applications. In this paper, we propose a coordinated mechanism for congestion control and multi-path transmission to reduce flow completion time in data centers.
Zhengwei Zhao   +4 more
openaire   +1 more source

Acquisition of Vehicle Control Algorithms

2003
In this paper, we present a multi-input multi-output (MIMO) dataacquired controller using system of hierarchical decision tables for a simulated vehicle driving control problem. The simulator incorporates dynamic mathematical model of a vehicle driving on a track.
Shang Fulian, Wojciech Ziarko
openaire   +1 more source

Topology control algorithms in WISELIB

Proceedings of the 2010 ICSE Workshop on Software Engineering for Sensor Network Applications, 2010
In wireless sensor networks, topology control algorithms are distributed algorithms whose goal is to infer a sub-network from the real network topologyin order to reduce the number of active nodes and active communication links, but preserving some desired property of the network (e.g., connectivity or low degree).
Jaume Anguera   +4 more
openaire   +2 more sources

Synchronization and control of parallel algorithms

Parallel Computing, 1985
Abstract We propose a modest collection of primitives for synchronization and control in parallel numerical algorithms. These are phrased in a syntax that is compatible with FORTRAN, creating a publication language for parallel software. A preprocessor may be used to map code written in this extended FORTRAN into standard FORTRAN with calls to the ...
Paul O. Frederickson   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy