Sciweavers

430 search results - page 16 / 86
» On Using Satisfiability-Based Pruning Techniques in Covering...
Sort
View
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
15 years 2 months ago
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
Luís Guerra e Silva, Luis Miguel Silveira, ...
89
Voted
ICANN
2007
Springer
15 years 4 months ago
Selection of Decision Stumps in Bagging Ensembles
Abstract. This article presents a comprehensive study of different ensemble pruning techniques applied to a bagging ensemble composed of decision stumps. Six different ensemble p...
Gonzalo Martínez-Muñoz, Daniel Hern&...
DAC
1989
ACM
15 years 2 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
CGF
2006
125views more  CGF 2006»
14 years 10 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
CORR
2006
Springer
160views Education» more  CORR 2006»
14 years 10 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...