Sciweavers

1813 search results - page 106 / 363
» Instance Pruning Techniques
Sort
View
CP
2005
Springer
15 years 12 months ago
Robust Constraint Solving Using Multiple Heuristics
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
VLDB
2005
ACM
125views Database» more  VLDB 2005»
15 years 12 months ago
Using Association Rules for Fraud Detection in Web Advertising Networks
Discovering associations between elements occurring in a stream is applicable in numerous applications, including predictive caching and fraud detection. These applications requir...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
15 years 12 months ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design e...
Bram De Wachter, Alexandre Genon, Thierry Massart
SAT
2010
Springer
136views Hardware» more  SAT 2010»
15 years 10 months ago
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
Abstract. We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause...
William Klieber, Samir Sapra, Sicun Gao, Edmund M....
WSC
2007
15 years 8 months ago
From domain ontologies to modeling ontologies to executable simulation models
Ontologies allow researchers, domain experts, and software agents to share a common understanding of the concepts and relationships of a domain. The past few years have seen the p...
Gregory A. Silver, Osama Al-Haj Hassan, John A. Mi...