Sciweavers

2260 search results - page 202 / 452
» A new algorithm for clustering search results
Sort
View
ECAI
2000
Springer
15 years 11 months ago
Search Pruning Conditions for Boolean Optimization
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
Vasco M. Manquinho, João P. Marques Silva
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
15 years 10 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson
IPPS
2005
IEEE
16 years 4 days ago
Parallelization of Direct Algorithms using Multisplitting Methods in Grid Environments
The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the ...
Jacques M. Bahi, Raphaël Couturier
GECCO
2005
Springer
134views Optimization» more  GECCO 2005»
16 years 1 days ago
Predicting mining activity with parallel genetic algorithms
We explore several different techniques in our quest to improve the overall model performance of a genetic algorithm calibrated probabilistic cellular automata. We use the Kappa ...
Sam Talaie, Ryan E. Leigh, Sushil J. Louis, Gary L...
KDD
2005
ACM
161views Data Mining» more  KDD 2005»
16 years 7 months ago
Combining email models for false positive reduction
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
Shlomo Hershkop, Salvatore J. Stolfo