3874 search results - page 318 / 775 » Approximation Algorithms for k-hurdle Problems |
170
click to vote
ICST
2010
IEEE
15 years 3 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
148
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
149
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
112
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
137
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...