980 search results - page 32 / 196 » Improving the Performance of Partitioning Methods for Crowd ... |
ISCA
2002
IEEE
13 years 7 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
Numerical methods for solving the systems of partial differential equations arising in geophysical fluid dynamics rely on a variety of spatial discretization schemes (e.g. finit...
AAI
2006
13 years 8 months ago
2006
Task decomposition in a multi-agent environment is often performed online. This paper proposes a method for subtask allocation that can be performed before the agents are deployed...
WSC
2007
13 years 10 months ago
2007
We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...
IMR
1999
Springer
14 years 4 days ago
1999
Springer
The primary focus of this project is to design and implement a parallel framework for an unstructured mesh generator based on the advancing front method (AFM). In particular, we t...