2479 search results - page 301 / 496 » Random Event Structures |
151
Voted
ISSTA
2012
ACM
13 years 5 months ago
2012
ACM
Swarm testing is a novel and inexpensive way to improve the diversity of test cases generated during random testing. Increased diversity leads to improved coverage and fault detec...
140
click to vote
AGENTS
2001
Springer
15 years 7 months ago
2001
Springer
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
136
click to vote
STOC
1996
ACM
15 years 6 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
119
click to vote
EURODAC
1995
IEEE
15 years 6 months ago
1995
IEEE
Iterative improvement partitioning algorithms such as the FM algorithm of Fiduccia and Mattheyses 8 , the algorithm of Krishnamurthy 13 , and Sanchis's extensions of these al...
110
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...