1968 search results - page 335 / 394 » The Complexity of Valued Constraint Models |
CORR
2000
Springer
13 years 8 months ago
2000
Springer
We describe a framework and equations used to model and predict the behavior of multi-agent systems (MASs) with learning agents. A difference equation is used for calculating the ...
SIGMETRICS
2000
ACM
13 years 8 months ago
2000
ACM
Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the &qu...
JMLR
2010
13 years 7 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
ICASSP
2011
IEEE
13 years 7 days ago
2011
IEEE
We consider the problem of tracking a maneuvering target in urban terrain with high clutter. Although multipath has been previously exploited to improve target tracking in complex...