Sciweavers

27 search results - page 2 / 6
» The Impact of Balancing on Problem Hardness in a Highly Stru...
Sort
View
IPPS
2007
IEEE
13 years 11 months ago
Effects of Replica Placement Algorithms on Performance of structured Overlay Networks
In DHT-based P2P systems, Replication-based content distribution and load balancing strategies consists of such decisions as which files should be replicated, how many replicas sh...
Bassam A. Alqaralleh, Chen Wang, Bing Bing Zhou, A...
CPAIOR
2010
Springer
13 years 2 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
COMPGEOM
2010
ACM
13 years 10 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
14 years 5 months ago
Large-scale behavioral targeting
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...
Ye Chen, Dmitry Pavlov, John F. Canny
ICC
2007
IEEE
174views Communications» more  ICC 2007»
13 years 11 months ago
Fairness Improvement and Efficient Rerouting in Mobile Ad Hoc Networks
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
Norihiro Ohata, Yongbing Zhang, Yusheng Ji, Xuemin...