9611 search results - page 234 / 1923 » A Note on Difference Sets |
199
click to vote
AIS
2004
Springer
15 years 12 months ago
2004
Springer
This project implements an integrated biological information website that classifies technical documents, learns about users' interests, and offers intuitive interactive visua...
192
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
185
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
156
click to vote
HPCA
1999
IEEE
15 years 11 months ago
1999
IEEE
In general-purpose microprocessors, recent trends have pushed towards 64-bit word widths, primarily to accommodate the large addressing needs of some programs. Many integer proble...
177
click to vote
AINA
2004
IEEE
15 years 10 months ago
2004
IEEE
Unlike host mobility support, network mobility is concerned with situations where an entire network changes its point of attachment to the Internet. Furthermore, we should conside...