23 search results - page 1 / 5 » An Efficient Parallel Algorithm for the General Planar Monot... |
SODA
1994
ACM
13 years 8 months ago
1994
ACM
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
INFORMATICALT
2006
13 years 7 months ago
2006
Three parallel algorithms for solving the 3D problem with nonlocal boundary condition are considered. The forward and backward Euler finite-difference schemes, and LOD scheme are t...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...