Results 261 to 270 of about 3,877,335 (299)

Prevalence of patient-reported and clinician-graded cognitive symptomatic adverse events in older patients with advanced cancer. [PDF]

JNCI Cancer Spectr
Alieldin R, Mohamed M, Li CS, Janelsins MC, Tylock R, Mustian KM, Peppone L, Kamen C, Lin PJ, Loh KP, Williams AM, Altman BJ, Vertino PM, Sun H, Gada U, Mohile SG, Hopkins JO, Faller BA, Vinciguerra V, Magnuson A.   +19 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Binary Decision Diagrams

IEEE Transactions on Computers, 1978
This paper describes a method for defining, analyzing, testing, and implementing large digital functions by means of a binary decision diagram. This diagram provides a complete, concise, "implementation-free" description of the digital functions involved.
exaly   +4 more sources

Timed binary decision diagrams

Proceedings International Conference on Computer Design VLSI in Computers and Processors, 1997
The paper presents an extension to OBDDs with timing information, called timed binary decision diagrams (TBDDs). TBDDs are also canonical and allow the symbolic manipulation of Boolean functions with timing information. A TBDD software package is implemented based on the existing CMU BDD package.
Zhongcheng Li, Yuhong Zhao, Yinghua Min, Robert K. Brayton   +3 more
openaire   +1 more source

Binary decision diagrams on network of workstations

Proceedings International Conference on Computer Design. VLSI in Computers and Processors, 2002
The success of all binary decision diagram (BDD) based synthesis and verification algorithms depend on the ability to efficiently manipulate very large BDDs. We present algorithms for manipulation of very large Binary Decision Diagrams (BDDs) on a network of workstations (NOW).
Rajeev K. Ranjan 0001, Jagesh V. Sanghavi, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli   +3 more
openaire   +1 more source

Comments on "A characterization of binary decision diagrams"

IEEE Transactions on Computers, 1994
Chakravarty presents a characterization of BDD's in terms of the complexity of some computational problems, ibid., vol. 42, p. 129-137, Feb. 1993. In these comments, some incorrectly stated restrictions on the "number of repeated variables" are corrected and results on the translation problem (to include EXOR and NEXOR gates) are generalized. >
openaire   +2 more sources

Binary Decision Diagrams

2018
Binary decision diagrams provide a data structure for representing and manipulating Boolean functions in symbolic form. They have been especially effective as the algorithmic basis for symbolic model checkers. A binary decision diagram represents a Boolean function as a directed acyclic graph, corresponding to a compressed form of decision tree.
openaire   +1 more source

Distributed binary decision diagrams for symbolic reachability

Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017
Decision diagrams are used in symbolic verification to concisely represent state spaces. A crucial symbolic verification algorithm is reachability: systematically exploring all reachable system states. Although both parallel and distributed reachability algorithms exist, a combined solution is relatively unexplored.
Wytse Oortwijn, Tom van Dijk, Jaco van de Pol   +2 more
openaire   +3 more sources

Binary superposed quantum decision diagrams

Quantum Information Processing, 2009
The key theme of this work is the binary superposed decision diagrams or BSQDDs for short. The basic idea that lies behind BSQDDs is to represent a quantum superposition as a decision diagram where each node on each branch of a BSQDD corresponds to a gate.
openaire   +2 more sources