Sciweavers

4377 search results - page 388 / 876
» Mass problems and randomness
Sort
View
TIME
2002
IEEE
15 years 11 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
171
Voted
SPIRE
2009
Springer
15 years 11 months ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher
196
Voted
AAAI
1994
15 years 8 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
ICML
2007
IEEE
16 years 7 months ago
Solving multiclass support vector machines with LaRank
Optimization algorithms for large margin multiclass recognizers are often too costly to handle ambitious problems with structured outputs and exponential numbers of classes. Optim...
Antoine Bordes, Jason Weston, Léon Bottou, ...
170
Voted
ICML
2004
IEEE
16 years 7 months ago
Learning and evaluating classifiers under sample selection bias
Classifier learning methods commonly assume that the training data consist of randomly drawn examples from the same distribution as the test examples about which the learned model...
Bianca Zadrozny