|
Results
Found 38 publication records. Showing 38 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Emad Aboelela, Christos Douligeris |
Switching Theory Approach to Alarm Correlation in Network Management. (PDF / PS)  |
LCN  |
2000 |
DBLP DOI BibTeX RDF |
switching theory approach, clustered alarm, fault diagnosis, expert systems, expert systems, network management, fault management, switching functions, switching functions, telecommunication computing, telecommunication network management, alarm correlation, telecommunication network reliability |
| 2 | Pablo P. Trabado, Antonio Lloris-Ruíz, Julio Ortega |
Solution of Switching Equations Based on a Tabular Algebra.  |
IEEE Trans. Computers  |
1993 |
DBLP DOI BibTeX RDF |
switching equations, tabular method, computer processing, benchmark equations, computational complexity, complexity, automatic test pattern generation, Boolean algebra, Boolean algebra, switching theory, switching theory |
| 1 | Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli |
Fun at a Department Store: Data Mining Meets Switching Theory.  |
FUN  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rza Bashirov, Fabrice Kordon, Hüseyin Lort |
Exploiting colored Petri nets to decide on permutation admissibility.  |
Acta Inf.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Felipe S. Marques, Leomar S. da Rosa Jr., Renato P. Ribas, Sachin S. Sapatnekar, André Inácio Reis |
DAG based library-free technology mapping.  |
ACM Great Lakes Symposium on VLSI  |
2007 |
DBLP DOI BibTeX RDF |
library free synthesis, logic synthesis, technology mapping, switching theory, virtual libraries |
| 1 | Cheng-Shang Chang, Yi-Ting Chen, Jay Cheng, Po-Kai Huang, Duan-Shin Lee |
From switching theory to "queueing" theory.  |
SIGMETRICS Performance Evaluation Review  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergiu Rudeanu, Dan A. Simovici |
On the Ranges of Algebraic Functions in Lattices - A Preliminary Report.  |
ISMVL  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | David R. Karger, Muriel Médard |
Toward Using the Network as a Switch: On the Use of TDM in Linear Optical Networks.  |
IEEE Journal on Selected Areas in Communications  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Houshang Darabi, Mohsen A. Jafari, Anna L. Buczak |
A control switching theory for supervisory control of discrete event systems.  |
IEEE Transactions on Robotics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil R. Das, Mansour H. Assaf, Emil M. Petriu, Sujoy Mukherjee |
Design of Aliasing Free Space Compressor in BIST with Maximal Compaction Ratio Using Concepts of Strong and Weak Compatibilities of Response Data Outputs and Generalized Sequence Mergeability.  |
IWDC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark G. Karpovsky, Radomir S. Stankovic, Claudio Moraga |
Spectral Techniques in Binary and Multiple-Valued Switching Theory.  |
ISMVL  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Rana Barua, Samik Sengupta |
Architectures for Arithmetic over GF(2m).  |
VLSI Design  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Joseph G. Peters |
Structured communication in torus networks.  |
HICSS  |
1995 |
DBLP DOI BibTeX RDF |
combinational switching, structured communication, one-to-all data movement patterns, all-to-all data movement patterns, 2D tori, multi-dimensional tori, synchronous circuit-switched routing, multi-scattering, circuit-switching algorithms, short routing, broadcasting, broadcasting, multiprocessor interconnection networks, gossiping, distributed memory systems, network routing, virtual channels, cycles, circuit switching, switching theory, scattering, torus networks, message length, store-and-forward routing |
| 1 | Hosame Abu-Amara, Vidya Gummadi |
New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks.  |
IEEE Trans. Parallel Distrib. Syst.  |
1994 |
DBLP DOI BibTeX RDF |
optical links, leader election algorithm, synchronous fiber-optic networks, timecomplexity, computational complexity, distributed algorithms, distributed algorithms, computer networks, message complexity, switching theory |
| 1 | Eugene D. Fabricius |
Modern digital design and switching theory.  |
|
1992 |
RDF |
|
| 1 | Anant Agarwal |
Performance Tradeoffs in Multithreaded Processors.  |
IEEE Trans. Parallel Distrib. Syst.  |
1992 |
DBLP DOI BibTeX RDF |
context-switchingoverhead, multiprocessingsystems, performance evaluation, parallel algorithms, caches, multiprocessor interconnection networks, storage management, data-sharing, buffer storage, switching theory, multithreaded processors, network bandwidth, network contention, parallelprogramming, cache interference |
| 1 | Shuo-Hsien Hsiao, C. Y. Roger Chen |
Performance Evaluation of Circuit Switched Multistage Interconnection Networks Using a Hold Strategy.  |
IEEE Trans. Parallel Distrib. Syst.  |
1992 |
DBLP DOI BibTeX RDF |
message size, circuit switched multistage interconnection networks, hold strategy, processor-memory communications, processor processing time, closed queuing network model, performance evaluation, performance evaluation, multiprocessor interconnection networks, queueing theory, multiprocessor systems, switching theory, memory access |
| 1 | Guan-Ing Chen, Ten-Hwang Lai, Yao-Nan Lien |
A Note on ``Generalized Hypercube and Hyperbus Structures for a Computer Network''.  |
IEEE Trans. Computers  |
1991 |
DBLP DOI BibTeX RDF |
hyperbus structures, least-cost generalized hypercube, computer network, computer networks, hypercube networks, switching theory |
| 1 | Hyoung B. Min, William A. Rogers |
Search strategy switching: A cost model and an analysis of backtracking.  |
J. Electronic Testing  |
1990 |
DBLP DOI BibTeX RDF |
search strategy switching, ATPG, fault coverage, backtracking |
| 1 | Robert Brian Cutler, Saburo Muroga |
Derivation of Minimal Sums for Completely Specified Functions.  |
IEEE Trans. Computers  |
1987 |
DBLP DOI BibTeX RDF |
Tison Method, Abridged minterm base, inclusion function, minimum sum, Petrick function, presence function, Quine- McCluskey method, programmable logic array, switching theory, branch-and-bound method |
| 1 | John P. Hayes |
Uncertainty, Energy, and Multiple-Valued Logics.  |
IEEE Trans. Computers  |
1986 |
DBLP DOI BibTeX RDF |
unknown values, pseudo- Boolean algebra, switch-level simulation, multiple-valued logic, Logic simulation, switching theory |
| 1 | Waldo C. Kabat, Anthony S. Wojcik |
Automated Synthesis of Combinational Logic Using Theorem-Proving Techniques.  |
IEEE Trans. Computers  |
1985 |
DBLP DOI BibTeX RDF |
logic design, multivalued logic, design automation, Automated theorem proving, switching theory |
| 1 | Tsutomu Sasao |
Input Variable Assignment and Output Phase Optimization of PLA's.  |
IEEE Trans. Computers  |
1984 |
DBLP DOI BibTeX RDF |
complexity of logic circuits, decoder assignment, essential prime implicants, output phase optimization, logic design, programmable logic array, Adder, switching theory |
| 1 | André Thayse |
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept.  |
IEEE Trans. Computers  |
1984 |
DBLP DOI BibTeX RDF |
Algorithmic state machines, factorization of Boolean matrices, implementation of algorithms, microprogrammed structures, parallel program schemata, P-functions, Petri nets, switching theory |
| 1 | André Thayse |
Synthesis and Optimization of Programs by Means of P-Funktions.  |
IEEE Trans. Computers  |
1982 |
DBLP DOI BibTeX RDF |
transformation of programs, Algorithmic state machine, microprogrammed structures, P-functions, optimization, switching theory |
| 1 | Jon C. Muzio |
Composite Spectra and the Analysis of Switching Circuits.  |
IEEE Trans. Computers  |
1980 |
DBLP DOI BibTeX RDF |
Rademacher?Walsh transform, Boolean functions, logic synthesis, switching theory, spectral transformations |
| 1 | Edward W. Page |
Minimally Testable Reed-Muller Canonical Forms.  |
IEEE Trans. Computers  |
1980 |
DBLP DOI BibTeX RDF |
Easily testable networks, logic design, fault detection, switching theory |
| 1 | Bernard M. E. Moret, Michael G. Thomason, Rafael C. Gonzalez |
The Activity of a Variable and Its Relation to Decision Trees.  |
ACM Trans. Program. Lang. Syst.  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederick C. Furtek |
Specification and Verification of Real-Time, Distributed Systems Using the Theory of Constraints.  |
CADE  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | André Thayse |
Meet and Join Derivatives and Their Use in Switching Theory.  |
IEEE Trans. Computers  |
1978 |
DBLP DOI BibTeX RDF |
prime implicants and prime implicates, extended vectors, meet and join derivatives, Boolean functions, consensus theory |
| 1 | Ronald E. Prather, Harold T. Casstevens II |
Realization of Boolean Expressions by Atomic Digraphs.  |
IEEE Trans. Computers  |
1978 |
DBLP DOI BibTeX RDF |
compiler theory, iterative circuits, programming languages, directed graphs, Boolean algebra, switching theory |
| 1 | Tsutomu Sasao, Kozo Kinoshita |
Realization of Minimum Circuits with Two-Input Conservative Logic Elements.  |
IEEE Trans. Computers  |
1978 |
DBLP DOI BibTeX RDF |
Conservative logic elements (CLE's), magnetic bubble logic, logic design, logic minimization, switching theory |
| 1 | John P. Hayes |
Enumeration of Fanout-Free Boolean Functions.  |
J. ACM  |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert McNaughton |
Automata, formal languages abstract switching, and computability in a Ph.D. computer science program.  |
Commun. ACM  |
1968 |
DBLP DOI BibTeX RDF |
Ph.D computer science curriculum, Ph.D computer science program, automata, formal languages, theory of computability, switching theory |
| 1 | David E. Muller |
The place of logical design and switching theory in the computer curriculum.  |
Commun. ACM  |
1964 |
DBLP DOI BibTeX RDF |
|
| 1 | T. H. Mott Jr. |
Symposium on Switching Theory.  |
IFIP Congress  |
1962 |
DBLP BibTeX RDF |
|
| 1 | William H. Kautz |
Some unsolved problems in switching theory  |
SWCT (FOCS)  |
1961 |
DBLP DOI BibTeX RDF |
|
| 1 | J. H. Shelly |
The decision and synthesis problems in semimodular switching theory  |
SWCT (FOCS)  |
1960 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #38 of 38 (100 per page; Change: )
|