1968 search results - page 255 / 394 » The Complexity of Valued Constraint Models |
113
click to vote
ICDCS
1999
IEEE
15 years 2 months ago
1999
IEEE
There is growing interest in run-time detection as parallel and distributed systems grow larger and more complex. This work targets run-time analysis of complex, interactive scien...
112
click to vote
ACMACE
2008
ACM
15 years 2 days ago
2008
ACM
BeatBender is a computer music project that explores a new method for generating emergent rhythmic drum patterns using the subsumption architecture. Rather than explicitly coding ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
We present a model, based on the maximum entropy method, for analyzing various measures of retrieval performance such as average precision, R-precision, and precision-at-cutoffs....
NIPS
2007
14 years 11 months ago
2007
We propose a Gaussian process (GP) framework for robust inference in which a GP prior on the mixing weights of a two-component noise model augments the standard process over laten...