428 search results - page 55 / 86 » An asynchronous complete method for distributed constraint o... |
102
Voted
NIPS
2007
15 years 4 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
143
Voted
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
193
Voted
ISPD
2012
ACM
13 years 11 months ago
2012
ACM
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
149
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
130
Voted
HICSS
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper we consider the complete supply chain for a large pulp producer in Sweden. The supply chain is divided up in two parts, the pulp production planning problem and the ...