Sciweavers

325 search results - page 22 / 65
» Alternatives to two classic data structures
Sort
View
103
Voted
ECAI
2008
Springer
14 years 11 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
BIBE
2005
IEEE
116views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
Stochastic Model of Protease-Ligand Reactions
Prediction of protein tertiary structure based on amino acid sequence is one of the most challenging open questions in computational molecular biology. The two most common experim...
Paul E. Anderson, Douglas W. Raiford, Deacon J. Sw...
AI
2011
Springer
14 years 4 months ago
A unifying action calculus
Abstract McCarthy’s Situation Calculus is arguably the oldest special-purpose knowledge representation formalism, designed to axiomatize knowledge of actions and their effects. ...
Michael Thielscher
CSDA
2007
123views more  CSDA 2007»
14 years 9 months ago
Bayesian estimation of unrestricted and order-restricted association models for a two-way contingency table
In two-way contingency tables analysis, a popular class of models for describing the structure of the association between the two categorical variables are the so-called “associ...
G. Iliopoulos, Maria Kateri, Ioannis Ntzoufras
PVLDB
2010
95views more  PVLDB 2010»
14 years 8 months ago
Small Domain Randomization: Same Privacy, More Utility
Random perturbation is a promising technique for privacy preserving data mining. It retains an original sensitive value with a certain probability and replaces it with a random va...
Rhonda Chaytor, Ke Wang