2638 search results - page 146 / 528 » Random Geometric Complexes |
161
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
191
click to vote
GRAPHICSINTERFACE
2000
15 years 7 months ago
2000
We introduce a new metaphor for learning spatial relations--the 3D puzzle. With this metaphor users learn spatial relations by assembling a geometric model themselves. For this pu...
181
Voted
KBSE
1997
IEEE
15 years 10 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
174
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
305
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...