Sciweavers

56 search results - page 10 / 12
» Boolean Constraint Solving Using clp(FD)
Sort
View
DAC
2008
ACM
14 years 8 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
DAC
2006
ACM
14 years 8 months ago
Topology aware mapping of logic functions onto nanowire-based crossbar architectures
Highly regular, nanodevice based architectures have been proposed to replace pure CMOS based architectures in the emerging post CMOS era. Since bottom-up self-assembly is used to ...
Wenjing Rao, Alex Orailoglu, Ramesh Karri
ECAI
2006
Springer
13 years 11 months ago
Decision with Uncertainties, Feasibilities, and Utilities: Towards a Unified Algebraic Framework
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
Cédric Pralet, Gérard Verfaillie, Th...
JNSM
2008
130views more  JNSM 2008»
13 years 7 months ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 11 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller