Sciweavers

1871 search results - page 280 / 375
» The Ephemeral Pairing Problem
Sort
View
ACM
1995
15 years 10 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
15 years 10 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
DAC
1995
ACM
15 years 10 months ago
Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
Yu-Liang Wu, Malgorzata Marek-Sadowska
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 10 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
AAAI
2008
15 years 8 months ago
Constraint Projections for Ensemble Learning
It is well-known that diversity among base classifiers is crucial for constructing a strong ensemble. Most existing ensemble methods obtain diverse individual learners through res...
Daoqiang Zhang, Songcan Chen, Zhi-Hua Zhou, Qiang ...