Sciweavers

1813 search results - page 26 / 363
» Instance Pruning Techniques
Sort
View
SAT
2004
Springer
94views Hardware» more  SAT 2004»
15 years 5 months ago
QBF Reasoning on Real-World Instances
Abstract. During the recent years, the development of tools for deciding Quantified Boolean Formulas (QBFs) has been accompanied by a steady supply of real-world instances, i.e., ...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
15 years 1 months ago
Making fast buffer insertion even faster via approximation techniques
Abstract— As technology scales to 0.13 micron and below, designs are requiring buffers to be inserted on interconnects of even moderate length for both critical paths and fixing...
Zhuo Li, Cliff C. N. Sze, Charles J. Alpert, Jiang...
CPAIOR
2007
Springer
15 years 6 months ago
Eliminating Redundant Clauses in SAT Instances
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...
Olivier Fourdrinoy, Éric Grégoire, B...
ICML
2008
IEEE
16 years 18 days ago
Adaptive p-posterior mixture-model kernels for multiple instance learning
In multiple instance learning (MIL), how the instances determine the bag-labels is an essential issue, both algorithmically and intrinsically. In this paper, we show that the mech...
Hua-Yan Wang, Qiang Yang, Hongbin Zha
ISPD
2006
ACM
68views Hardware» more  ISPD 2006»
15 years 5 months ago
Solving hard instances of floorplacement
Physical Design of modern systems on chip is extremely challenging. Such digital integrated circuits often contain tens of millions of logic gates, intellectual property blocks, e...
Aaron N. Ng, Igor L. Markov, Rajat Aggarwal, Venky...