1968 search results - page 335 / 394 » The Complexity of Valued Constraint Models |
102
click to vote
CORR
2000
Springer
15 years 1 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 ...
100
click to vote
SIGMETRICS
2000
ACM
15 years 1 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...
130
click to vote
JMLR
2010
14 years 12 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...
111
click to vote
SPIRE
2010
Springer
14 years 11 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...
136
click to vote
ICASSP
2011
IEEE
14 years 5 months 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...