1921 search results - page 95 / 385 » Making AC-3 an Optimal Algorithm |
196
Voted
IWCMC
2010
ACM
15 years 12 days ago
2010
ACM
Load imbalance that deteriorates the system performance is a severe problem existing in 3GPP LTE networks. To deal with this problem, we propose in this paper a load balancing fra...
169
Voted
DIALM
2007
ACM
15 years 6 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
120
Voted
AI
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
127
Voted
ISPA
2005
Springer
15 years 8 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
105
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...