Sciweavers

305 search results - page 32 / 61
» Boosting Set Constraint Propagation for Network Design
Sort
View
WWW
2010
ACM
14 years 2 months ago
Find me if you can: improving geographical prediction with social and spatial proximity
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...
Lars Backstrom, Eric Sun, Cameron Marlow
WWW
2007
ACM
14 years 8 months ago
Long distance wireless mesh network planning: problem formulation and solution
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...
Sayandeep Sen, Bhaskaran Raman
FMCAD
2007
Springer
14 years 1 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
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...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
ATVA
2008
Springer
86views Hardware» more  ATVA 2008»
13 years 9 months ago
NetQi: A Model Checker for Anticipation Game
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...
Elie Bursztein
AAAI
1996
13 years 9 months ago
A Graph-Based Method for Improving GSAT
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...
Kalev Kask, Rina Dechter