標(biāo)題: Titlebook: Representations of Discrete Functions; Tsutomu Sasao,Masahiro Fujita Book 1996 Kluwer Academic Publishers 1996 CAD.algorithms.complexity.c [打印本頁(yè)] 作者: commotion 時(shí)間: 2025-3-21 16:08
書目名稱Representations of Discrete Functions影響因子(影響力)
書目名稱Representations of Discrete Functions影響因子(影響力)學(xué)科排名
書目名稱Representations of Discrete Functions網(wǎng)絡(luò)公開度
書目名稱Representations of Discrete Functions網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Representations of Discrete Functions被引頻次
書目名稱Representations of Discrete Functions被引頻次學(xué)科排名
書目名稱Representations of Discrete Functions年度引用
書目名稱Representations of Discrete Functions年度引用學(xué)科排名
書目名稱Representations of Discrete Functions讀者反饋
書目名稱Representations of Discrete Functions讀者反饋學(xué)科排名
作者: 樣式 時(shí)間: 2025-3-21 21:47 作者: 輕推 時(shí)間: 2025-3-22 02:03
Edge Valued Binary Decision Diagrams, its representation as a pseudo Boolean function. Utilizing this, we present algorithms for computing the probability spectrum and the Reed-Muller spectrum of a Boolean function directly on the .. Finally, we describe an extension of .s which associates both an additive and a multiplicative weight with the true edges of the function graph.作者: Minikin 時(shí)間: 2025-3-22 06:58
Spectral Transform Decision Diagrams,ectively. This chapter shows that an STDD represents a function and its spectral transform at the same time. As for .-bit adders, ACDDs and WDDs require .(.) nodes while MTBDDs require .(2.) nodes. As for .-bit multipliers, ACDDs and WDDs require .(..) nodes while MTBDDs require .(4.) nodes.作者: Confound 時(shí)間: 2025-3-22 11:54 作者: 慢跑 時(shí)間: 2025-3-22 16:40 作者: magenta 時(shí)間: 2025-3-22 19:13
Complexity Theoretical Aspects of OFDDs,the same variable ordering. The replacement of variables by constants may cause an exponential blow-up of the OFDD size. Finally, it is investigated how a local change of the variable ordering may change the OFDD size. This leads to simulated annealing algorithms to improve variable orderings.作者: nerve-sparing 時(shí)間: 2025-3-22 22:45 作者: 吹牛者 時(shí)間: 2025-3-23 03:49 作者: 碎石 時(shí)間: 2025-3-23 05:50 作者: figurine 時(shí)間: 2025-3-23 12:21 作者: 碎石頭 時(shí)間: 2025-3-23 14:46
Multi-Terminal Binary Decision Diagrams and Hybrid Decision Diagrams,ow multi-terminal binary decision diagrams (MTBDDs) can be used to represent such functions concisely. The Walsh transform and Reed-Muller transform have numerous applications in computer-aided design, but the usefulness of these techniques in practice has been limited by the size of the binary valu作者: 蟄伏 時(shí)間: 2025-3-23 18:07
Edge Valued Binary Decision Diagrams,functions (PBF). .s are particularly useful when both arithmetic and Boolean operations are required. We describe a general algorithm on .s for performing any binary operation that is closed over the integers. Next, we discuss the relation between the probability expression of a Boolean function and作者: Arroyo 時(shí)間: 2025-3-24 00:18
Arithmetic Transform of Boolean Functions,ns. Such arithmetic transformations can give us new insight into solving some interesting problems. For example, the transformed functions can be easily evaluated (simulated) on integers or real numbers. Through such arithmetic simulation we can probabilistically verify a pair of functions with much作者: 侵蝕 時(shí)間: 2025-3-24 02:46
,OKFDDs — Algorithms, Applications and Extensions,nctions. OKFDDs are a generalization of Ordered Binary Decision Diagrams and Ordered Functional Decision Diagrams and as such provide a more compact representation of the functions than either of the two decision diagrams. We review basic properties of OKFDDs and study methods for their efficient re作者: Synapse 時(shí)間: 2025-3-24 08:06 作者: 數(shù)量 時(shí)間: 2025-3-24 11:09 作者: Radiculopathy 時(shí)間: 2025-3-24 17:15
Satisfiability Problems for OFDDs,UNT. We prove that SAT-ALL has a running time linear in the product of the number of satisfying assignments and the size of the given OFDD. Counting the satisfying assignments in an OFDD is proved to be #.-complete, and thus not possible in polynomial time unless P=NP.作者: 美食家 時(shí)間: 2025-3-24 19:01
Complexity Theoretical Aspects of OFDDs,or to OBDDs (ordered binary decision diagrams). Most of the complexity theoretical problems have been solved for OBDDs. Here some results for OFDDs are proved. It is NP-complete to decide whether a function represented by some OFDD can be represented by an OFDD of size s using another variable order作者: 切掉 時(shí)間: 2025-3-25 00:23 作者: 過(guò)多 時(shí)間: 2025-3-25 05:17
Or-and-Or Three-Level Networks,ented variables are available, and each gate has no fan-in and fan-out constraints. We show that an arbitrary .-variable function can be realized by an OR-AND-OR three-level network with at most 2. + 1 gates, where . = 2. and . is an integer. We also prove that for sufficiently large ., regardless o作者: Morphine 時(shí)間: 2025-3-25 11:20
Exact Minimization of FPRMs Using Multi-Terminal Exor TDDs,TBDDs) to represent extended truth vectors and weight vectors, respectively. Various techniques to reduce computation time and memory storage are developed. Experimental results up to 94 inputs are shown. The presented method outperforms existing methods.作者: 使堅(jiān)硬 時(shí)間: 2025-3-25 11:56 作者: 胰島素 時(shí)間: 2025-3-25 19:35 作者: Lumbar-Stenosis 時(shí)間: 2025-3-25 23:35
Tsutomu Sasaoes Lokalit?tsverhaltens von Programmen sowie der Ersetzungs-strategien im Zusammenspiel mit den anderen Systemkomponenten k?nnen jedoch nur mit Hilfe der Simulation gewonnen werden..Weitere Untersuchungen auf der Grundlage des vorgestellten Modells befassen sich mit dem Einflu? global wirkender Seit作者: tariff 時(shí)間: 2025-3-26 04:09 作者: AWE 時(shí)間: 2025-3-26 08:10 作者: Debrief 時(shí)間: 2025-3-26 10:35
Sarma B. K. Vrudhula,Massoud Pedram,Yung-Te Laies Lokalit?tsverhaltens von Programmen sowie der Ersetzungs-strategien im Zusammenspiel mit den anderen Systemkomponenten k?nnen jedoch nur mit Hilfe der Simulation gewonnen werden..Weitere Untersuchungen auf der Grundlage des vorgestellten Modells befassen sich mit dem Einflu? global wirkender Seit作者: Pelago 時(shí)間: 2025-3-26 13:31 作者: GENUS 時(shí)間: 2025-3-26 19:10 作者: Motilin 時(shí)間: 2025-3-26 23:57 作者: Transfusion 時(shí)間: 2025-3-27 02:34 作者: 延期 時(shí)間: 2025-3-27 06:39 作者: Delude 時(shí)間: 2025-3-27 13:19
Tsutomu SasaoPufferüberl?ufe, welche in parallelen, verteilten Systemen auftreten k?nnen, vermieden. Die Verwendung von Datenbanken, einem imperativen, in der Praxis oft ben?tigten Sprachelement wird erm?glicht, wobei die funktionalen Grundzüge der Sprache weitestgehend erhalten bleiben.作者: 使閉塞 時(shí)間: 2025-3-27 16:16 作者: indignant 時(shí)間: 2025-3-27 18:47
nt économique, scientifi que et technologique de l’Europe. Accroitre l’intérêt des jeunes pour les sciences et la technologie est essentiel pour notre futur collectif et constitue un défi majeur pour l’éducation. Ce livre présente des analyses et des idées pour de possibles solutions.978-94-6091-982-4作者: Frenetic 時(shí)間: 2025-3-28 00:10
Arithmetic Transform of Boolean Functions,a function is quantifiable and extremely low. Also, the procedures are computationally very efficient. Using a real-valued or integer-valued representation we can derive testability measures for elements of a digital circuit, or conduct the reliability analysis for various networks.作者: 熟練 時(shí)間: 2025-3-28 05:09 作者: 牽連 時(shí)間: 2025-3-28 08:11
Or-and-Or Three-Level Networks,ee-level networks require, on the average, 40% fewer gates than AND-OR two-level ones. For other benchmark functions of 9 to 128 variables, three-level networks required up to 91% fewer gates. For randomly generated functions of 10 variables, three-level networks required 50% fewer gates.作者: Definitive 時(shí)間: 2025-3-28 11:28
Book 1996sis, and complexity ofthree-level logic networks. ..Representations of Discrete Functions. is designed for CADresearchers and engineers and will also be of interest to computerscientists who are interested in combinatorial problems. .Exercises prepared by the editors help make this book useful as ag作者: FIN 時(shí)間: 2025-3-28 15:25 作者: 女歌星 時(shí)間: 2025-3-28 21:23
me to be general descriptions of what people now want computers to do for them..Computers, of course, are machines, and the programs that direct the actions of these machines are algorithmic schemata..But the new idea in the industry is the recognition that machines and programs "are" their represe作者: 協(xié)議 時(shí)間: 2025-3-28 23:38
Shin-ichi Minatome durch Modelle zu beschreiben. Aufbauend auf Modellkriterien für Rechnersysteme mit einer zweistufigen Speicherhierarchie, für Programmverhalten und Betriebssystemstrategien wurde ein verfeinertes Modell entwickelt und mit Hilfe der Simulation untersucht. Ausserdem wurde eine mathematische Analyse作者: 溫順 時(shí)間: 2025-3-29 05:14 作者: 盡忠 時(shí)間: 2025-3-29 08:45 作者: 不要不誠(chéng)實(shí) 時(shí)間: 2025-3-29 14:21
Edmund M. Clarke,Masahiro Fujita,Xudong Zhaome durch Modelle zu beschreiben. Aufbauend auf Modellkriterien für Rechnersysteme mit einer zweistufigen Speicherhierarchie, für Programmverhalten und Betriebssystemstrategien wurde ein verfeinertes Modell entwickelt und mit Hilfe der Simulation untersucht. Ausserdem wurde eine mathematische Analyse作者: CURL 時(shí)間: 2025-3-29 17:10 作者: MENT 時(shí)間: 2025-3-29 21:50 作者: 曲解 時(shí)間: 2025-3-30 03:57
Tsutomu Sasao,Fumitaka Izuharaseits werden sübrekursive Klassen dadurch konstruiert, da? gewisse Operationen wie Komposition, Rekursion und Iteration auf eine Menge von ?erzeugenden“ oder Basisfunktionen wiederholt angewendet werden; Beispiele sind die Klasse der primitiv-rekursiven Funktionen und deren Teilklassen. Andererseits作者: 空氣 時(shí)間: 2025-3-30 04:56
J?rg Bullmann,Udo Kebschullseits werden sübrekursive Klassen dadurch konstruiert, da? gewisse Operationen wie Komposition, Rekursion und Iteration auf eine Menge von ?erzeugenden“ oder Basisfunktionen wiederholt angewendet werden; Beispiele sind die Klasse der primitiv-rekursiven Funktionen und deren Teilklassen. Andererseits作者: Incisor 時(shí)間: 2025-3-30 11:05 作者: 火花 時(shí)間: 2025-3-30 16:12 作者: 原來(lái) 時(shí)間: 2025-3-30 19:45 作者: 牢騷 時(shí)間: 2025-3-31 00:47 作者: 溫順 時(shí)間: 2025-3-31 03:59
nology (ET) is a major concern in Europe today. Their participation in engineering occupations appears to be a key-issue for European economic and technical development, as well as a central achievement towards gender equality and social justice. Increasing young people’s interest in the sciences an
