830 search results - page 30 / 166 » Generalizing Global Constraints Based on Network Flows |
115
click to vote
DAC
2009
ACM
15 years 5 months ago
2009
ACM
Structured ASICs have recently emerged as an exciting alternative to ASIC or FPGA design style as they provide a new trade-off between the high performance of ASIC design and low ...
112
click to vote
ANCS
2009
ACM
14 years 11 months ago
2009
ACM
OpenFlow switching enables flexible management of enterprise network switches and experiments on regular network traffic. We present in this paper a complementary design to OpenFl...
137
click to vote
P2P
2010
IEEE
14 years 12 months ago
2010
IEEE
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
111
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
130
click to vote
CCE
2005
15 years 1 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...