9842 search results - page 304 / 1969 » Problem complexity |
187
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
162
click to vote
AAAI
2008
15 years 9 months ago
2008
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
162
click to vote
FGCS
2000
15 years 6 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
174
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
229
click to vote
GECCO
2003
Springer
16 years 5 hour ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...