830 search results - page 49 / 166 » Generalizing Global Constraints Based on Network Flows |
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
CISS
2010
IEEE
13 years 14 days ago
2010
IEEE
— AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when...
RTSS
2003
IEEE
14 years 2 months ago
2003
IEEE
—Many real-time systems have firm real-time requirements which allow occasional deadline violations but discard any jobs that are not finished by their deadlines. To measure the ...
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
EKAW
2004
Springer
14 years 2 months ago
2004
Springer
Among the various tasks involved in building a Bayesian network for a real-life application, the task of eliciting all probabilities required is generally considered the most daunt...