2436 search results - page 377 / 488 » Evaluating Adaptive Problem Selection |
110
click to vote
COMCOM
2007
15 years 3 months ago
2007
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
142
Voted
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
160
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
117
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently adopted...
140
Voted
USS
2008
15 years 5 months ago
2008
We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same s...