867 search results - page 44 / 174 » The Generalized Maximum Coverage Problem |
INFOCOM
2002
IEEE
14 years 1 months ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
AAAI
2008
13 years 10 months ago
2008
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
ISSRE
2006
IEEE
14 years 2 months ago
2006
IEEE
Test suite reduction uses test requirement coverage to determine if the reduced test suite maintains the original suite’s requirement coverage. Based on observations from our pr...
COGSCI
2006
13 years 8 months ago
2006
We consider human performance on an optimal stopping problem where people are presented with a list of numbers independently chosen from a uniform distribution. People are told ho...