Sciweavers

1405 search results - page 281 / 281
» We Are No Longer A Priesthood
Sort
View
TC
1998
13 years 10 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer
INFOCOM
2010
IEEE
13 years 9 months ago
Enhancing Wireless TCP: A Serialized-Timer Approach
— In wireless networks, TCP performs unsatisfactorily since packet reordering and random losses may be falsely interpreted as congestive losses. This causes TCP to trigger fast r...
Chengdi Lai, Ka-Cheong Leung, Victor O. K. Li
PVLDB
2010
112views more  PVLDB 2010»
13 years 9 months ago
Two-way Replacement Selection
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacemen...
Xavier Martinez-Palau, David Dominguez-Sal, Josep-...
RCIS
2010
13 years 9 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
FPL
2010
Springer
124views Hardware» more  FPL 2010»
13 years 8 months ago
Finding System-Level Information and Analyzing Its Correlation to FPGA Placement
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
Farnaz Gharibian, Lesley Shannon, Peter Jamieson