Sciweavers

4103 search results - page 418 / 821
» Some results on the Collatz problem
Sort
View
183
Voted
CP
1995
Springer
15 years 10 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
KDD
1995
ACM
67views Data Mining» more  KDD 1995»
15 years 10 months ago
A Perspective on Databases and Data Mining
We discuss the use of database met hods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data stru...
Marcel Holsheimer, Martin L. Kersten, Heikki Manni...
AAAI
2008
15 years 9 months ago
Reinforcement Learning for Vulnerability Assessment in Peer-to-Peer Networks
Proactive assessment of computer-network vulnerability to unknown future attacks is an important but unsolved computer security problem where AI techniques have significant impact...
Scott Dejmal, Alan Fern, Thinh Nguyen
AAAI
2008
15 years 9 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
BIRD
2008
Springer
131views Bioinformatics» more  BIRD 2008»
15 years 8 months ago
Identifying Subcellular Locations from Images of Unknown Resolution
Our group has previously used machine learning techniques to develop computational systems to automatically analyse fluorescence microscope images and classify the location of the ...
Luís Pedro Coelho, Robert F. Murphy