5595 search results - page 460 / 1119 » Approximation Algorithms for Clustering Problems |
183
Voted
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
225
click to vote
MP
2010
15 years 6 months ago
2010
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
224
click to vote
QEST
2008
IEEE
16 years 2 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
203
click to vote
FORMATS
2004
Springer
16 years 29 days ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
216
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...