569 search results - page 26 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
PVLDB
2010
13 years 3 months ago
2010
Although there has been a considerable body of work on skyline evaluation in multidimensional data with totally ordered attribute domains, there are only a few methods that consid...
PPL
2010
13 years 3 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
ISCAS
1994
IEEE
14 years 23 days ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...
PC
2002
13 years 8 months ago
2002
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...