Sciweavers

721 search results - page 110 / 145
» On Generators of Random Quasigroup Problems
Sort
View
CP
2007
Springer
15 years 5 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
GECCO
2006
Springer
138views Optimization» more  GECCO 2006»
15 years 5 months ago
Does overfitting affect performance in estimation of distribution algorithms
Estimation of Distribution Algorithms (EDAs) are a class of evolutionary algorithms that use machine learning techniques to solve optimization problems. Machine learning is used t...
Hao Wu, Jonathan L. Shapiro
AAAI
2008
15 years 4 months ago
A New Incomplete Method for CSP Inconsistency Checking
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
Belaid Benhamou, Mohamed Réda Saïdi
NIPS
2007
15 years 3 months ago
Spatial Latent Dirichlet Allocation
In recent years, the language model Latent Dirichlet Allocation (LDA), which clusters co-occurring words into topics, has been widely applied in the computer vision field. Howeve...
Xiaogang Wang, Eric Grimson
ACL
2006
15 years 3 months ago
Combining Statistical and Knowledge-Based Spoken Language Understanding in Conditional Models
Spoken Language Understanding (SLU) addresses the problem of extracting semantic meaning conveyed in an utterance. The traditional knowledge-based approach to this problem is very...
Ye-Yi Wang, Alex Acero, Milind Mahajan, John Lee