305 search results - page 32 / 61 » Boosting Set Constraint Propagation for Network Design |
113
Voted
WWW
2010
ACM
15 years 7 months ago
2010
ACM
Geography and social relationships are inextricably intertwined; the people we interact with on a daily basis almost always live near us. As people spend more time online, data re...
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
112
click to vote
FMCAD
2007
Springer
15 years 6 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
92
Voted
ATVA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. NetQi is a freely available model-checker designed to analyze network incidents such as intrusion. This tool is an implementation of the anticipation game framework, a va...
AAAI
1996
15 years 1 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...