2976 search results - page 87 / 596 » On the bounded integer programming |
114
Voted
JCT
2010
14 years 11 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
103
Voted
ICGA
2007
15 years 14 days ago
2007
In this paper it will be explained how to use bitboards for move generation in shogi. In chess, bitboards have been used in most strong programs because of the easy representation...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
113
Voted
GLVLSI
1996
IEEE
15 years 4 months ago
1996
IEEE
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
83
Voted
TON
1998
15 years 5 days ago
1998
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...