2714 search results - page 307 / 543 » Approximation Schemes for Scheduling |
175
click to vote
TAPIA
2005
ACM
16 years 4 days ago
2005
ACM
We present a numerical study for two systems of conservation laws using a spacetime discontinuous Galerkin (SDG) method with causal spacetime triangulations and the piecewise cons...
184
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
206
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
171
click to vote
NIPS
2001
15 years 8 months ago
2001
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
163
click to vote
IJBC
2002
15 years 6 months ago
2002
The relationship between Cellular Nonlinear Networks (CNNs) and Partial Differential Equations (PDEs) is investigated. The equivalence between discrete-space CNN models and contin...