The proceedings contain 15 papers. The special focus in this conference is on stochasticalgorithms Foundations and Applications. The topics include: Prospects of quantum informatics;a converging ACO algorithm for sto...
ISBN:
(纸本)3540201033
The proceedings contain 15 papers. The special focus in this conference is on stochasticalgorithms Foundations and Applications. The topics include: Prospects of quantum informatics;a converging ACO algorithm for stochastic combinatorial optimization;optimality of randomized algorithms for the intersection problem;stochasticalgorithms for gene expression analysis;analysis of a randomized local search algorithm for LDPCC decoding problem;testing a simulated annealing algorithm in a classification problem;global search through sampling using a PDF;simulated annealing for optimal pivot selection in jacobian accumulation;quantum data compression;on the stochastic open shop problem;global optimization;imposing passing restrictions on slow vehicles increases the flow;average-case complexity of partial boolean functions and classes of binary rational distributions closed under discrete transformations.
The proceedings contain 105 papers. The topics discussed include: application of extended universal generating function technique to dynamic reliability analysis of a multi-state system;closed and mixed type queuing s...
ISBN:
(纸本)9781467399418
The proceedings contain 105 papers. The topics discussed include: application of extended universal generating function technique to dynamic reliability analysis of a multi-state system;closed and mixed type queuing systems as mathematical models of reliability and survivability;asymptotic expansions for stationary distributions of perturbed semi-Markov processes;reliability and safety of nuclear power plant instrumentation and control systems: new challenges and solutions;multi-state deteriorating system dependability with maintenance using Monte Carlo simulation;a new approach to simultaneous latent ability & test difficulty estimation;a combinatorial approach for analyzing start-up demonstration tests;optimizing system design under degrading failure agents;wind speed and power forecasting - a review and incorporating asymmetric loss;use of stochastic models for operational efficiency analysis of multi power source traction drives;and multi-state Markov model for reliability analysis of a combined cycle gas turbine power plant.
The proceedings contains 47 papers. Topics discussed include memory performance and architecture, communication networks and routing, allocation and load balancing, algorithms and techniques, synchronization, communic...
详细信息
The proceedings contains 47 papers. Topics discussed include memory performance and architecture, communication networks and routing, allocation and load balancing, algorithms and techniques, synchronization, communication and prefetching, tools, environment and techniques, simulation, tools and techniques, parallel systems andalgorithms.
The proceedings contains 92 papers from the 1996 internationalsymposium on Parallel Architectures, algorithms and Networks. Topics discussed include: massively parallel processors;distributed memory parallel computer...
详细信息
The proceedings contains 92 papers from the 1996 internationalsymposium on Parallel Architectures, algorithms and Networks. Topics discussed include: massively parallel processors;distributed memory parallel computers;multistage interconnection networks;Banyan switching fabrics;internetworking;transmission control protocol/Internet protocol networks;train traffic and event driven simulations;universal broadband network access devices;customer premises networks;and parallel random access machines.
The proceedings contain 22 papers. The special focus in this conference is on Optimal algorithms. The topics include: Foreword;randomization in parallel algorithms and its impact on computational geometry;optimal boun...
ISBN:
(纸本)9783540518594
The proceedings contain 22 papers. The special focus in this conference is on Optimal algorithms. The topics include: Foreword;randomization in parallel algorithms and its impact on computational geometry;optimal bounds on the dictionary problem;optimal constant space move-to-fear list organization;improved bounds on the size of separators of toroidal graphs;on some properties of (a,b)-trees;disassembling two-dimensional composite parts via translations;which triangulations approximate the complete graph?: Conference abstract;the approximability of problems complete for P;a structural overview of NP optimization problems;sorting within distance bound on a mesh-connected processor array;local insertion sort revisited;there are planar graphs almost as good as the complete graphs and as short as minimum spanning trees;packet routing on grids of processors;optimal parallel computations for halin graphs;optimal parallel algorithms for b-matchings in trees;computing digitized voronoi diagrams on a systolic screen and applications to clustering;pRAM algorithms for identifying polygon similarity;a framework for parallel graph algorithm design;fast soliton automata;an upper bound on the order of locally testable deterministic finite automata;a fast algorithm to decide on simple grammars equivalence;complexity of the parallel Givens factorization on shared memory architectures.
The proceedings contain 41 papers. The special focus in this conference is on algorithms. The topics include: Decision-making with incomplete information;maximum independent set of a permutation graph in k tracks;algo...
ISBN:
(纸本)9783540549451
The proceedings contain 41 papers. The special focus in this conference is on algorithms. The topics include: Decision-making with incomplete information;maximum independent set of a permutation graph in k tracks;algorithms for square roots of graphs;distributed k-mutual exclusion problem and k-coteries;weighted random assignments with application to hashing;scheduling file transfers under port and channel constraints;substitution decomposition on chordal graphs and applications;mixed-searching and proper-path-width;short wire routing in convex grids;a new approach to knock-knee channel routing;an average case analysis of monien and speckenmeyer's mechanical theorem proving algorithm;an on-line algorithm for navigating in unknown terrain;on maintaining the width and diameter of a planar point-set online;optimal triangulations by retriangulating;an incremental algorithm for constructing shortest watchman routes;on hitting grid points in a convex polygon with straight lines;on the complexity of some hamiltonian and eulerian problems in edge-colored complete graphs;dynamic programming on intervals;combinatorial optimization through order statistics;combinatorics andalgorithms of geometric arrangements;an analysis of randomized shear sort on the mesh computer;efficient parallel divide-and-conquer for a class of lnterconnection topologies;optimal specified root embedding of full binary trees in faulty hypercubes;a tight lower bound for the worst case of bottom-up heapsort;historical searching and sorting;comparison-efficient and write-optimal searching and sorting;nearest neighbors revisited;competitiveness and response time in on-line algorithms;a linear time optimal via assignment algorithm for three-dimensional channel routing;symmetry of information and one-way functions.
A nonstationary semi-iterative method is developed based on the Richardson's two step iterative method (RFII-SI method). The performance of the method is analysed when it is applied to the classes of generalized s...
详细信息
A nonstationary semi-iterative method is developed based on the Richardson's two step iterative method (RFII-SI method). The performance of the method is analysed when it is applied to the classes of generalized stochastic problem and Ortega's problem through the theoretical and practical (computational) points of view. Some of the theoretical results are nonetheless applicable to more general problems as well.
This paper presents two classes of adaptive blindalgorithms based on second- and higher order statistics. The first class contains fast recursive algorithms whose cost functions involve second and third- or fourth-or...
详细信息
This paper presents two classes of adaptive blindalgorithms based on second- and higher order statistics. The first class contains fast recursive algorithms whose cost functions involve second and third- or fourth-order cumulants. These algorithms are stochastic gradient-based but have structures similar to the fast transversal filters (FTF) algorithms. The second class is composed of two stages: the first stage uses a gradient adaptive lattice (GAL) while the second stage employs a higher order-cumulant (HOC) based least mean squares (LMS) filter. The computational loads for these algorithms are all linearly proportional to the number of taps used, Furthermore, the second class, as various numerical examples indicate, yields very fast convergence rates and low steady state mean square errors (MSE) and intersymbol interference (ISI), MSE convergence analyses for the proposed algorithms are also provided and compared with simulation results.
A parallel distributed scheme is presented for coding random patterns generated via iteration of contraction mappings. The scheme is implemented by a decentralized computational process an distributed parameter system...
详细信息
ISBN:
(纸本)0818678704
A parallel distributed scheme is presented for coding random patterns generated via iteration of contraction mappings. The scheme is implemented by a decentralized computational process an distributed parameter system. The distributed parameter system generates a representation of missing probability for attractor as the basis of design of contraction mappings. The local minimals of missing probability is extracted and aggregated as the decentralized representation of contraction mappings. The coding scheme is verified through computer simulation.
暂无评论