Sciweavers

151 search results - page 12 / 31
» Handling Boolean A Boxes
Sort
View
PVLDB
2010
110views more  PVLDB 2010»
13 years 5 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
14 years 4 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
IPPS
2009
IEEE
14 years 2 months ago
GenWrapper: A generic wrapper for running legacy applications on desktop grids
Desktop Grids represent an alternative trend in Grid computing using the same software infrastructure as Volunteer Computing projects, such as BOINC. Applications to be deployed o...
Csaba Attila Marosi, Zoltán Balaton, P&eacu...
GD
1997
Springer
13 years 11 months ago
Orthogonal 3-D Graph Drawing
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
Therese C. Biedl, Thomas C. Shermer, Sue Whiteside...
DELTA
2002
IEEE
14 years 13 days ago
Minimization and Partitioning Method Reducing Input Sets
The article describes a new Boolean minimization and single-level partitioning method based on the BOOM minimization system [6]. The minimization is performed with respect to the ...
Jan Hlavicka, Petr Fiser