4403 search results - page 173 / 881 » Galois Theory of Algorithms |
169
click to vote
ROBOCUP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
167
click to vote
IJCNN
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper shows an application in the field of Electronic CAD of the Selfish Gene algorithm, an evolutionary algorithm based on a recent interpretation of the Darwinian theory. Te...
154
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
175
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
192
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...