1884 search results - page 110 / 377 » Simple Algorithm for Simple Timed Games |
DAM
2007
14 years 12 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
CG
2005
Springer
14 years 11 months ago
2005
Springer
This article discusses an enhanced polygonization algorithm for variational implicit surfaces. The polygonization scheme is a simple hierarchical adaptation of the Marching Cubes ...
177
click to vote
POPL
2008
ACM
16 years 6 days ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
117
click to vote
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...