Search results for "minimisation"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Michael Faulkner, D. Contos, Mark A. Briffa	Performance of automatic phase adjustment using supply current minimisation in a RF feedback lineariser.	PIMRC	1997	DBLP DOI BibTeX RDF
17	Alberto González 0001, Antonio Albiol, Steve J. Elliott	Minimisation of the maximum error signal in active control.	ICASSP	1997	DBLP DOI BibTeX RDF
17	Rizos Sakellariou, John R. Gurd	Compile-Time Minimisation of Load Imbalance in Loop Nests.	International Conference on Supercomputing	1997	DBLP DOI BibTeX RDF
17	Elena Stöhr, Michael F. P. O'Boyle	A Graph Based Approach to Barrier Synchronisation Minimisation.	International Conference on Supercomputing	1997	DBLP DOI BibTeX RDF
17	Vassili A. Kovalev, Maria Petrou	An Energy Minimisation Approach to the Registration, Matching and Recognition of Images.	CAIP	1997	DBLP DOI BibTeX RDF
17	Marleen Adé, Rudy Lauwereins, J. A. Peperstraete	Data Memory Minimisation for Synchronous Data Flow Graphs Emulated on DSP-FPGA Targets.	DAC	1997	DBLP DOI BibTeX RDF
17	Susanne Graf, Bernhard Steffen, Gerald Lüttgen	Compositional Minimisation of Finite State Systems Using Interface Specifications.	Formal Aspects Comput.	1996	DBLP DOI BibTeX RDF
17	Steve R. Gunn, Mark S. Nixon	Snake head boundary extraction using global and local energy minimisation.	ICPR	1996	DBLP DOI BibTeX RDF
17	John Shawe-Taylor, Peter L. Bartlett, Robert C. Williamson, Martin Anthony	A Framework for Structural Risk Minimisation.	COLT	1996	DBLP DOI BibTeX RDF
17	Tirthankar RayChaudhuri, Leonard G. C. Hamey	Minimisation of data collection by active learning.	ICNN	1995	DBLP DOI BibTeX RDF
17	Christophe Calvin	Minimisation du sur-coût des communications dans la parallélisation des algorithmes numériques. (Minimization of the overhead of communications in the parallelization of numerical algorithms).		1995	RDF
17	Sandro Ridella, Gian Luca Speroni, Paolo Trebino, Rodolfo Zunino	Class-Entropy Minimisation Networks for Domain Analysis and Rule Extraction.	Neural Comput. Appl.	1994	DBLP DOI BibTeX RDF
17	P. Patrick van der Smagt	Minimisation methods for training feedforward neural networks.	Neural Networks	1994	DBLP DOI BibTeX RDF
17	Martin Janssen, Francky Catthoor, Hugo De Man	A specification invariant technique for operation cost minimisation in flow-graphs.	HLSS	1994	DBLP DOI BibTeX RDF
17	S. Gopalsamy, T. Sathi Reddy	Energy and error function minimisation for computation of optimal shape parameters.	Comput. Graph.	1993	DBLP DOI BibTeX RDF
17	Visit Hirankitti, Christopher J. Hogger	A Generalised Query Minimisation for Program Debugging.	AADEBUG	1993	DBLP DOI BibTeX RDF
17	Vedat Tavsanoglu	Singular value decomposition in sensitivity minimisation for digital filters.	ISCAS	1993	DBLP BibTeX RDF
17	Cheng Jiaxin, Phil G. Howlett	Application of critical velocities to the minimisation of fuel consumption in the control of trains.	Autom.	1992	DBLP DOI BibTeX RDF
17	Dominique Revuz	Minimisation of Acyclic Deterministic Automata in Linear Time.	Theor. Comput. Sci.	1992	DBLP DOI BibTeX RDF
17	Silvano Martello, François Soumis, Paolo Toth	An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines.	IPCO	1992	DBLP BibTeX RDF
17	K. R. Rao, K. S. Raghunathan	Constrained Via Minimisation In Greedy Channel Routing.	VLSI Design	1992	DBLP DOI BibTeX RDF
17	Karl-Heinz Erhard, Frank M. Johannes	Area Minimisation of IC Power/Ground Nets by Topology Optimisation.	VLSI	1991	DBLP BibTeX RDF
17	Norbert Wehn, Jörg Biesenack, Michael Pilsl	A New Approach to Multiplexer Minimisation in the CALLAS Synthesis Environment.	VLSI	1991	DBLP BibTeX RDF
17	Guoan Bi	Minimisation of delay requirements for rational sampling rate alternating systems.	ICASSP	1991	DBLP DOI BibTeX RDF
17	R. Pears, W. A. Gray	Response Time Minimisation in a Parallel Database System.	BNCOD	1991	DBLP BibTeX RDF
17	Meir M. Lehman	Software uncertainty and the role of CASE in its minimisation and control.	Jerusalem Conference on Information Technology	1990	DBLP DOI BibTeX RDF
17	Andrew M. Gravell	Minimisation in Formal Specification and Design.	Z User Workshop	1989	DBLP DOI BibTeX RDF
17	Michel Carvallo	Sur La Minimisation D'une Expression Représentant une Famille de Fonctions Booléennes.	RAIRO Theor. Informatics Appl.	1985	DBLP DOI BibTeX RDF
17	David Hall, Paul John Lyons	An appraisal of thi applicability to molecular packing analysis of some global minimisation techniques.	Comput. Chem.	1980	DBLP DOI BibTeX RDF
17	B. N. Suresh	The minimisation of power losses in Electrohydraulic Servo Systems.		1978	RDF
17	J. W. Akitt	Function Minimisation Using the Nelder and Mead Simplex Method with Limited Arithmetic Precision: The Self Regenerative Simplex.	Comput. J.	1977	DBLP DOI BibTeX RDF
17	Guy Pierra	Eclatement de Contraintes en Parallèle pour la Minimisation d'une Forme Quadratique.	Optimization Techniques	1975	DBLP DOI BibTeX RDF
17	D. Zissos, Fraser G. Duncan	Boolean Minimisation.	Comput. J.	1973	DBLP DOI BibTeX RDF
17	Edwige Idée	Minimisation d'une fonction quasi-convexe aléatoire : applications.		1973	RDF
17	B. Papp	Procédé pour déterminer les formes normales minimales des fonctions booléennes, en utilisant les règles de minimisation de la fonction de coût.	Acta Cybern.	1972	DBLP BibTeX RDF
17	S. Hoshino	On Davies, Swann and Campey Minimisation Process.	Comput. J.	1971	DBLP DOI BibTeX RDF
17	V. A. LoDato	The Minimisation of Distance in Placement Algorithms.	Comput. J.	1971	DBLP DOI BibTeX RDF
17	Bruce A. Murtagh, R. W. H. Sargent	Computational Experience with Quadratically Convergent Minimisation Methods.	Comput. J.	1970	DBLP DOI BibTeX RDF
17	George Karoly, J. W. Marquet	A Mathematical Basis For A Terminal Network Cost Minimisation Strategy.	Aust. Comput. J.	1969	DBLP BibTeX RDF
17	J. D. Pearson	Variable metric methods of minimisation.	Comput. J.	1969	DBLP DOI BibTeX RDF
17	Stanley L. Hurst	An extension of binary minimisation techniques to ternary equations.	Comput. J.	1968	DBLP DOI BibTeX RDF
17	R. Fletcher	Certification of algorithm 251: function minimisation.	Commun. ACM	1966	DBLP DOI BibTeX RDF
17	M. Wells	Algorithm 251: function minimisation [E4].	Commun. ACM	1965	DBLP DOI BibTeX RDF
16	Stanislav Zivný, David A. Cohen, Peter G. Jeavons	The Expressive Power of Binary Submodular Functions.	MFCS	2009	DBLP DOI BibTeX RDF	Decomposition of submodular functions, Pseudo-Boolean optimisation, Submodular function minimisation, Min-Cut
16	C. Weliwitage, A. L. Harvey, Andrew B. Jennings	Handwritten Document Offline Text Line Segmentation.	DICTA	2005	DBLP DOI BibTeX RDF	cut text minimisation, text line segmentation, handwriting, offline
16	P. Svenerudh, Benny Raphael, Ian F. C. Smith	Lowering Costs of Timber Shear-Wall Design using Global Search.	Eng. Comput.	2002	DBLP DOI BibTeX RDF	Cost minimisation, Shear walls, Timber design, Genetic algorithms, Optimization, Object representation, Global search
16	Tim Kovacs	What should a classifier system learn and how should we measure it?	Soft Comput.	2002	DBLP DOI BibTeX RDF	Learning metrics, Minimisation of expressions, Boolean functions, Representation, XCS, Classifier systems
16	Dinesh Pamunuwa, Hannu Tenhunen	On Dynamic Delay and Repeater Insertion in Distributed Capacitively Coupled Interconnects.	ISQED	2002	DBLP DOI BibTeX RDF	Cross-talk, Delay minimisation, Static timing, Repeater insertion, Deep sub-micron
16	J. Living, M. Moniri, S. B. Tennakoon	Efficient Recursive Digital Filters using Combined Look-Ahead Denominator Distribution and Numerator Decomposition.	J. VLSI Signal Process.	2001	DBLP DOI BibTeX RDF	IIR digital filters, iteration bound, look ahead pipelining, resource minimisation
16	Jaewon Oh, Hyokyung Bahn, Chris Wu, Kern Koh	Pareto-based soft real-time task scheduling in multiprocessor systems.	APSEC	2000	DBLP DOI BibTeX RDF	soft real-time task scheduling, processor minimization, deadline missing time, Pareto-based genetic algorithm, genetic algorithms, scheduling, performance, real-time systems, parallel programming, parallel program, multiprocessing systems, multiprocessor systems, experimental results, minimisation, Pareto-optimal set
16	David R. Karger, Maria Minkoff	Building Steiner Trees with Incomplete Global Knowledge.	FOCS	2000	DBLP DOI BibTeX RDF	combinational switching, incomplete global knowledge, network usage minimization, data item distribution, data-requesting clients, connection probability, fixed data path specification, concave cost functions, open facilities, minimum demand, bicriterion approximation, assignment cost, trees (mathematics), Steiner trees, client-server systems, facility location, minimisation, approximation theory, uncertainty handling, facility location problem, economies of scale, vertex, network synthesis, network design problems
16	Venkatesan Guruswami, Johan Håstad, Madhu Sudan 0001	Hardness of Approximate Hypergraph Coloring.	FOCS	2000	DBLP DOI BibTeX RDF	approximate hypergraph coloring, covering complexity, probabilistic verifier, PCP verifier, 2-colorable 4-uniform hypergraph, hardness assumption, computational complexity, computational geometry, minimisation, graph colouring, hardness, minimization problems
16	Yu-Sheng Huang, Chih-wen Hsueh	Minimizing the maximum end-to-end delay on tree structure using the distributed pinwheel model.	RTCSA	2000	DBLP DOI BibTeX RDF	maximum end-to-end delay minimisation, distributed pinwheel model, end-to-end timing requirements, tight maximum delay bound, quality of service, Internet, computational complexity, timing, computer networks, heuristic algorithm, processor scheduling, timing constraints, simulation result, distributed real-time systems, tree structure, heuristic programming, NP-hard problems, linear-time algorithm, pipeline structure
16	Susana C. Esquivel, Claudia Gatica, Raúl Héctor Gallard	Evolutionary Approaches with Multirecombination for the Parallel Machine Scheduling Problem.	SCCC	2000	DBLP DOI BibTeX RDF	multirecombination, parallel machine scheduling problem, multiple task assignment, makespan minimization, job precedence constraints, scheduling, evolutionary algorithms, resource allocation, evolutionary computation, experiments, parallel machines, minimisation, resource availability, parallel task scheduling, job allocation
16	Shankar L. Regunathan, Kenneth Rose	Motion Vector Quantization in a Rate-Distortion Framework.	ICIP (2)	1997	DBLP DOI BibTeX RDF	rate-distortion framework, codebook design, rate-distortion cost minimisation, multistage structure, multiresolution nature, multistage motion quantization, scalable video coding applications, motion estimation, video coding, vector quantization, motion compensation, video sequences, iterative algorithm, PSNR
16	V. Barakat, B. Guilpart, Robert Goutte, Rémy Prost	Model-Based Tikhonov-Miller Image Restoration.	ICIP (1)	1997	DBLP DOI BibTeX RDF	Tikhonov-Miller image restoration, Miller-Tikhonov restoration method, reconstruction error minimisation, a priori model, Tikhonov regularisation, image restoration, optimal model, local information, model-based method
16	Marc C. Robini, Thierry Rastello, Didier Vray, Isabelle E. Magnin	Space-Variant Deconvolution for Synthetic Aperture Imaging Using Simulated Annealing.	ICIP (1)	1997	DBLP DOI BibTeX RDF	reflection density recovery, synthetic aperture imaging, synthetic aperture image formation, space-variant 2D convolution, ill-posed inverse problem, underdetermined problem, concave stabilizers, discontinuities preservation, non-convex functional minimisation, Metropolis-type annealing algorithm, inexpensive acceleration techniques, convergence results, performance, stabilization, simulated annealing, efficiency, image restoration, synthetic aperture radar, simulated data, ill-conditioned problem
16	Bala Kalyanasundaram, Kirk Pruhs	Minimizing Flow Time Nonclairvoyantly.	FOCS	1997	DBLP DOI BibTeX RDF	flow time minimization, dynamically arriving jobs, unknown execution times, average response/flow time, classic CPU scheduling problem, time sharing operating systems, standard 3-field scheduling notation, nonclairvoyant version, randomized nonclairvoyant algorithm, RMLF, multi level feedback algorithm, deterministic nonclairvoyant algorithm, scheduling, minimisation, competitive ratio, Unix operating system, adaptive adversary
16	Jae-dong Lee, Kyung-Hee Kwon, Young-Beom Park	Minimizing communication in bitonic sorting software.	ICPADS	1997	DBLP DOI BibTeX RDF	bitonic sorting software, communication minimisation, GENERAL-BS, MINIMIZING-BS, shared-memory parallel computers, parity strategy, sorting, local memory, parallel sorting algorithms
16	Sébastien Roy 0001, Jean Meunier, Ingemar J. Cox	Cylindrical rectification to minimize epipolar distortion.	CVPR	1997	DBLP DOI BibTeX RDF	epipolar distortion minimisation, cylindrical rectification, epipolar lines, stereo image processing, stereo matching, camera motions, stereo images, camera geometry
16	Jin-Tai Yan	A simple yet effective genetic approach for the orientation assignment on cell-based layout.	VLSI Design	1996	DBLP DOI BibTeX RDF	genetic approach, orientation assignment, cell-based layout, total wire length minimisation, placement phase, routing area reduction, orientation states, vertical orientation bit, horizontal orientation bit, genetic algorithms, VLSI, VLSI design, network routing, circuit layout CAD, integrated circuit layout
16	Prathima Agrawal, Balakrishnan Narendran, Narayanan Shivakumar	Multi-way partitioning of VLSI circuits.	VLSI Design	1996	DBLP DOI BibTeX RDF	multi-way partitioning, hierarchical design processes, nets cut metric, VLSI, delays, economics, logic CAD, VLSI layout, integrated circuit layout, VLSI circuits, logic partitioning, minimisation of switching nets, average delay, integrated circuit manufacture, cost metric
16	Nripendra N. Biswas, C. Srikanth, James Jacob	Cubical CAMP for minimization of Boolean functions.	VLSI Design	1996	DBLP DOI BibTeX RDF	cubical CAMP algorithm, single Boolean function, QCAMP, UNATE TEST, cyclic function, prime cubes, Achilles heel function, Boolean functions, minimization, minimisation of switching nets, BISECT, unate function
16	Mads Nielsen	Surface Reconstruction: GNCs and MFA.	ICCV	1995	DBLP DOI BibTeX RDF	GNCs, MFA, noise corrupted surfaces, quadratic data term, non convex functional minimisation, approximating functional, fully automatic methods, Gaussian convolution, Blake-Zisserman Graduated Non Convexity, graduated non convexity, image reconstruction, surface reconstruction, Bayes methods, convexity, minimum description length, Bayesian estimation, convex functionals, variational techniques, mean field annealing, variational approach
16	Vicent Caselles, Ron Kimmel, Guillermo Sapiro	Geodesic Active Contours.	ICCV	1995	DBLP DOI BibTeX RDF	geodesy, object boundary detection, active contour deformation, intrinsic geometric measures, evolving contours, exterior boundaries, interior boundaries, minimal distance curves, Riemannian space, classical snakes, geometric active contours, computer vision, image segmentation, metric, image, object detection, object detection, energy minimization, active vision, minimisation, geodesics, object segmentation, curve evolution, image content, geodesic active contours
16	Laurent D. Cohen	Auxiliary Variables for Deformable Models.	ICCV	1995	DBLP DOI BibTeX RDF	mathematical formulation, surface reconstruction algorithms, two step iterative algorithms, potential data attraction, variables energy, implicit data constraint, non convex potential, explicit convex reconstruction problem, closest feature point, feature extraction, iterative methods, image restoration, image restoration, deformable models, templates, minimisation, auxiliary variables
16	Roberto Manduchi, Pietro Perona	Pyramidal implementation of deformable kernels.	ICIP	1995	DBLP DOI BibTeX RDF	deformable kernels, pyramidal decomposition, multirate implementation, quadratic error criterion, hypermatrix algebra, multilinear problem, pseudo-SVD, quadratic approximation error minimisation, basis filters, steerable-scalable decomposition, computer vision, computer vision, image processing, image processing, global optimization, singular value decomposition, rendering, iterative methods, matrix algebra, aliasing, filtering theory, rendering (computer graphics), image filtering, Kronecker algebra, iterative procedure
16	Mingui Sun, Robert J. Sclabassi	Symmetric wavelet edge detector of the minimum length.	ICIP	1995	DBLP DOI BibTeX RDF	symmetric wavelet edge detector, infinite support, minimum length, wavelet transforms, wavelet transform, edge detection, images, minimisation, digital filters, digital filters, computational cost, roundoff errors, truncation error, edge localization
16	Mark J. Wolski, Charles A. Bouman, Jan P. Allebach, Eric Walowit	Optimization of sensor response functions for colorimetry of reflective and emissive objects.	ICIP	1995	DBLP DOI BibTeX RDF	optical filters, optical variables measurement, sensor response functions, system noise, emissive objects, reflective objects, color filters, surface color measurement device, XYZ tristimulus vector, reflective surfaces, emissive surfaces, error minimization, filter roughness, filter implementation errors, system tolerance, design, error analysis, minimisation, linear structure, colorimetry, colorimetry, nonlinear optimization problem
16	KyungHi Chang, XuDuan Lin	Ultra-high-speed digital filtering algorithm for video signal processing.	ICIP	1995	DBLP DOI BibTeX RDF	ultra-high-speed digital filtering algorithm, improved minimum-order augmented pipelining, IMAP algorithm, clustered look-ahead technique, augmented pipelining order, undesirable quantization effects, 1-D IMAP digital filter, 2-D structure, bandwidth reduction algorithm, motion estimation, motion estimation, pipeline processing, minimization, minimisation, video signal processing, video signal processing, interference suppression, two-dimensional digital filters, spatio-temporal filtering
16	Paul Salama, Ness B. Shroff, Edward J. Coyle, Edward J. Delp	Error concealment techniques for encoded video streams.	ICIP	1995	DBLP DOI BibTeX RDF	encoded video streams, error concealment techniques, error-recovery approaches, MPEG encoded video, nearest undamaged pixels, lost macroblocks, minimizing intersample variations, packing ATM cells, compressed data, optimal iterative reconstruction, asynchronous transfer mode, interpolation, data compression, image sequences, video coding, image reconstruction, image reconstruction, iterative methods, ATM networks, motion compensation, motion compensation, minimisation, visual communication, telecommunication standards, broadband networks, spatial interpolation, error compensation
16	J. S. Lerman, Sanjeev R. Kulkarni	Convex shape reconstruction from noisy ray probe measurements.	ICIP	1995	DBLP DOI BibTeX RDF	interference (signal), convex shape reconstruction, noisy ray probe measurements, two-dimensional convex shape, radial distances, target shape, quadratic minimization problem, computational simplicity, computational complexity, transformation, image reconstruction, minimisation, linear constraints, additive noise, coordinate system, nonlinear constraints
16	Rachid Sammouda, Noboru Niki, Hiromu Nishitani	Multichannel segmentation of magnetic resonance cerebral images based on neural networks.	ICIP	1995	DBLP DOI BibTeX RDF	multichannel segmentation, magnetic resonance cerebral images, cost-term, energy function minimization, temporary noise, metastaric tumor, neural networks, image segmentation, convergence, medical image processing, minimisation, brain, brain, Hopfield neural network, convergence of numerical methods, biomedical NMR, Hopfield neural nets, global minimum
16	Shinji Watanabe 0002, Yujiro Akimoto, Takashi Komatsu, Takahiro Saito	A new stabilized zero-crossing representation in the wavelet transform domain and signal reconstruction.	ICIP	1995	DBLP DOI BibTeX RDF	stabilized zero-crossing representation, wavelet transform domain, local features extraction, minimum-norm optimization problem, linear simultaneous equation, fractional sampling interval accuracy, iterative reconstruction algorithm, feature extraction, wavelet transforms, image reconstruction, image reconstruction, iterative methods, image representation, minimisation, image sampling, numerical stability, picture quality, signal reconstruction
16	Patrick L. Combettes	Constrained image recovery in a product space.	ICIP	1995	DBLP DOI BibTeX RDF	constrained image recovery, product space, feasibility set, quadratic minimization problems, convex minimization problems, parallel algorithms, parallel algorithms, image reconstruction, inverse problems, minimisation, cost function
16	Moreno Coli, Paolo Palazzari	Global execution time minimization by allocating tasks in parallel systems.	PDP	1995	DBLP DOI BibTeX RDF	global execution time minimization, heuristic criterion, starting population, static allocation, genetic algorithms, genetic algorithm, computational complexity, resource allocation, parallel machines, parallel machine, directed graphs, directed acyclic graphs, DAGs, processor scheduling, parallel systems, task allocation, NP-complete problem, execution time, minimisation, cost function, critical path, precedence relations, critical path analysis
16	Noam Nisan, Avi Wigderson	Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version).	FOCS	1995	DBLP DOI BibTeX RDF	restricted classes, computational complexity, lower bounds, digital arithmetic, polynomials, logic circuits, arithmetic circuits, multivariate polynomials, complexity measure, minimisation of switching nets, partial derivatives
16	S. Lavabre, Yves Bertrand, Michel Renovell, Christian Landrault	Test configurations to enhance the testability of sequential circuits.	Asian Test Symposium	1995	DBLP DOI BibTeX RDF	shift operation, scan register, test operation, modified flip-flops, ISCAS89 benchmarks, multiconfiguration, triconfiguration, dynamic generation, logic testing, controllability, design for testability, design for testability, sequential circuits, sequential circuits, observability, observability, DFT, fault coverage, flip-flops, minimisation, scan designs, test application time, test vector
16	Xiaodong Wang, Vwani P. Roychowdhury	Minimizing communication overhead for matrix inversion algorithms on hypercubes.	IPPS	1995	DBLP DOI BibTeX RDF	matrix inversion algorithms, Gauss-Jordan inversion algorithms, parallel inversion algorithms, MIMD hypercube, parallel algorithms, performance analysis, hypercubes, communication complexity, hypercube networks, minimisation, data partitioning, communication overhead, matrix inversion, interrupt handling, asynchronous message passing
16	Sasan Iman, Massoud Pedram	Two-level logic minimization for low power.	ICCAD	1995	DBLP DOI BibTeX RDF	Power Prime Implicants, low power two-level logic minimization, minimum covering problem, minimum power solution, static CMOS circuits, logic design, logic CAD, integrated circuit design, CMOS logic circuits, circuit CAD, circuit optimisation, minimisation of switching nets
16	Takahiro Hozumi, Naotake Kamiura, Yutaka Hata, Kazuharu Yamato	Multiple-Valued Logic Design Using Multiple-Valued EXOR.	ISMVL	1995	DBLP DOI BibTeX RDF	multiple-valued EXOR, sum operation, multiple valued sum of products expression, binary EXOR of MINs expressions, three valued EXOR of MINs expression, three valued two variable functions, multiple valued EXOR of MINs expressions, MAX of MINs, TSUM of MINs expressions, logic design, neural nets, multivalued logic, logic minimization, minimisation of switching nets, neural computing, multiple valued logic design, multiple-valued logic design
16	Yann-Hang Lee, Randy Chow, Sandra E. Cheung	Circular window control schemes in fast packet switches.	ICCCN	1995	DBLP DOI BibTeX RDF	circular window control scheme, fast packet switches, packet switch fabrics, fixed length window, circular transmission sequences, contentions minimisation, maximal throughput, nonblocking switches, banyan-based blocking switches, performance analysis, packet switching, scheduling algorithm, queueing, simulation results
16	Raffaele Bolla, Franco Davoli, Mario Marchese	Simple schemes for traffic integration at call set-up level in ATM networks.	ICCCN	1995	DBLP DOI BibTeX RDF	traffic integration, call set-up level, blocking probability minimisation, statistical parameters, average bandwidth, peak bandwidth, maximum number of acceptable calls, stationary traffic conditions, output queueing node model, simulation, quality of service, asynchronous transfer mode, ATM networks, call admission control, cost functions, feasibility region
16	Stephen Keung, Kai-Yeung Siu	Efficient protocols secure against guessing and replay attacks.	ICCCN	1995	DBLP DOI BibTeX RDF	password guessing, efficient protocols, password protection, nonces minimisation, protocols, multicast communications, secure communications, peer-to-peer communication, replay attacks
16	Shashidhar Thakur, D. F. Wong 0001	Simultaneous area and delay minimum K-LUT mapping for K-exact networks.	ICCD	1995	DBLP DOI BibTeX RDF	area/delay minimum K-LUT mapping, K-exact networks, technology mapping problem, lookup table FPGAs, area minimization problem, K-bounded networks, delay minimization problem, flow-map algorithm, field programmable gate arrays, computational complexity, complexity, NP-complete, logic design, polynomial time algorithm, programmable logic arrays, table lookup, minimisation of switching nets
16	Tomasz Kozlowski, Erik L. Dagless, Jonathan Saul	An enhanced algorithm for the minimization of exclusive-OR sum-of-products for incompletely specified functions.	ICCD	1995	DBLP DOI BibTeX RDF	minimization algorithm, exclusive-OR sum-of-products, rule-based heuristics, initial circuit description, MINT, multiple-product-term transformations, multiple-valued input two-valued multiple-output functions, knowledge based systems, logic design, heuristic programming, minimisation of switching nets, incompletely specified functions
16	Aiguo Lu, Erik L. Dagless, Jonathan M. Saul	DART: delay and routability driven technology mapping for LUT based FPGAs.	ICCD	1995	DBLP DOI BibTeX RDF	DART, delay driven technology mapping, LUT based FPGAs, two-phased approach, routability directed delay-optimal mapping, stochastic routability analysis, delay-optimal mapping, field programmable gate arrays, delays, logic design, programmable logic arrays, table lookup, minimisation of switching nets
16	Rolf Drechsler, Bernd Becker 0001	Dynamic minimization of OKFDDs.	ICCD	1995	DBLP DOI BibTeX RDF	dynamic minimization, OKFDDs, small Ordered Kronecker Functional Decision Diagrams, Ordered Functional Decision Diagrams, dynamic variable ordering, decomposition type choice, OKFDD package, Boolean functions, logic design, directed graphs, decision theory, diagrams, minimisation, Ordered Binary Decision Diagrams, PUMA
16	Timothy Kam, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli	Implicit state minimization of non-deterministic FSMs.	ICCD	1995	DBLP DOI BibTeX RDF	implicit state minimization, nondeterministic finite state machines, fully implicit algorithm, finite state machines, logic design, minimisation
16	Luis F. G. Sarmenta, Gill A. Pratt, Stephen A. Ward	Rational clocking [digital systems design].	ICCD	1995	DBLP DOI BibTeX RDF	rational clocking, independently-clocked digital subsystems, finite probability, phase relationship, delays, delays, logic design, logic design, synchronisation, clocks, minimisation of switching nets, digital systems design, synchronization failure
16	Chuan-Yu Wang, Kaushik Roy 0001	Control unit synthesis targeting low-power processors.	ICCD	1995	DBLP DOI BibTeX RDF	control unit synthesis, low-power processors, low-power decoding scheme, microprogrammed architecture, nanoprogrammed architecture, 8086 instruction set, instruction opcodes, computer architecture, logic design, encoding, decoding, microprocessor chips, graph embedding, instruction sets, microprogramming, CMOS circuits, logic minimization, system reliability, switching activity, minimisation of switching nets, pseudo-Boolean programming
16	Jimmy Shinn-Hwa Wang, Wayne Wei-Ming Dai	Transformation of min-max optimization to least-square estimation and application to interconnect design optimization.	ICCD	1995	DBLP DOI BibTeX RDF	min-max optimization transformation, interconnect design optimization, tighter bound, circuit layout CAD, minimisation, least squares approximations, multichip modules, multichip modules, least-square estimation, minimax techniques
16	Rajeev Murgai, Masahiro Fujita, Fumiyasu Hirose	Logic synthesis for a single large look-up table.	ICCD	1995	DBLP DOI BibTeX RDF	single large look-up table, LUT-based field-programmable gate array architectures, simulation time minimisation, compile-code, software simulation, field programmable gate arrays, Boolean function, logic design, logic synthesis, hardware accelerator, programmable logic arrays, table lookup, logic simulation, FPGA architectures, logic functions, on-chip memory, memory constraint
16	Hirendu Vaishnav, Massoud Pedram	Logic extraction based on normalized netlengths.	ICCD	1995	DBLP DOI BibTeX RDF	logic extraction, normalized netlengths, chip area, routing, logic design, logic synthesis, cost function, minimisation of switching nets
16	Robert M. Fuhrer, Bill Lin 0001, Steven M. Nowick	Algorithms for the optimal state assignment of asynchronous state machines.	ARVLSI	1995	DBLP DOI BibTeX RDF	optimal state assignment, asynchronous state machines, state codes, race-free state assignment, hazard-free state assignment, input encoding problem, sum-of-products implementations, finite state machines, asynchronous circuits, state assignment, minimisation of switching nets, hazards and race conditions, asynchronous sequential logic
16	Stan Y. Liao, Srinivas Devadas, Kurt Keutzer	Code density optimization for embedded DSP processors using data compression techniques.	ARVLSI	1995	DBLP DOI BibTeX RDF	code density optimization, embedded DSP processors, code size minimization, text compression algorithms, TMS320C25 code generator, VLSI, data compression, data compression, skeleton, minimisation, dictionary, digital signal processing chips, VLSI systems, production cost
16	Ted Stanion, Carl Sechen	Quasi-algebraic decompositions of switching functions.	ARVLSI	1995	DBLP DOI BibTeX RDF	quasi-algebraic decompositions, algebraic product, binary Boolean operation, canonical manner, SSL testable, logic testing, testability, switching functions, switching functions, state assignment, minimisation of switching nets, benchmark circuits, circuit size
16	Emile Haddad	Optimal load distribution for asynchronously scheduled homogeneous multiprocessor and distributed systems.	HICSS (2)	1995	DBLP DOI BibTeX RDF	optimal load distribution, asynchronously scheduled homogeneous multiprocessor systems, interacting tasks, identical processors, job completion time minimization, execution initiation times, earliest availability, load parameters, optimal load allocation, uneven module distribution, distributed systems, resource allocation, distributed processing, multiprocessing systems, processor scheduling, minimisation, system parameters, processor assignment
16	Ernst W. Mayr	Scheduling interval orders in parallel.	HICSS (2)	1995	DBLP DOI BibTeX RDF	interval order scheduling, interval representations, transitively oriented digraph, undirected chordal complement, identical parallel processors, minimal length schedule, scheduling distance computation subroutine, incremental version, empty slots, interval order precedence constraints, scheduling, parallel algorithms, parallel algorithm, computational complexity, concurrency control, directed graphs, partial orders, NP-complete problems, deadlines, execution time, minimisation, interval graphs, optimal schedule, release times, NC-algorithm, CREW-PRAM, task systems
16	Manjit Borah, Robert Michael Owens, Mary Jane Irwin	Fast algorithm for performance-oriented Steiner routing.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	performance-oriented Steiner routing, fast routing algorithm, Elmore delay minimisation, layout generators, computational complexity, VLSI, data structures, data structures, delays, iterative methods, network routing, circuit layout CAD, integrated circuit layout, iterative techniques