2137 search results - page 303 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
175
click to vote
ILP
2007
Springer
15 years 11 months ago
2007
Springer
Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths...
160
click to vote
ESA
1998
Springer
15 years 9 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
151
Voted
EMO
2001
Springer
15 years 9 months ago
2001
Springer
We compare two multiobjective evolutionary algorithms, with deterministic gradient based optimization methods for the dose optimization problem in high-dose rate (HDR) brachythera...
140
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
145
click to vote
CVPR
2003
IEEE
16 years 7 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...