Sciweavers

861 search results - page 42 / 173
» Faster integer multiplication
Sort
View
124
Voted
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
15 years 10 months ago
New Results on the Complexity of the Middle Bit of Multiplication
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
Ingo Wegener, Philipp Woelfel
TIT
2011
102views more  TIT 2011»
15 years 7 hour ago
Sequence Families With Low Correlation Derived From Multiplicative and Additive Characters
For integer r satisfying 0 ≤ r ≤ p − 2, a sequence family Ωr of polyphase sequences of prime period p, size (p − 2)pr , and maximum correlation at most 2 + (r + 1) √ p...
Kai-Uwe Schmidt
EOR
2010
159views more  EOR 2010»
14 years 12 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
TCAD
2010
130views more  TCAD 2010»
14 years 11 months ago
On ATPG for Multiple Aggressor Crosstalk Faults
Crosstalk faults have emerged as a significant mechanism for circuit failure. Long signal nets are of particular concern because they tend to have a higher coupling capacitance to...
Kunal P. Ganeshpure, Sandip Kundu
ICC
2008
IEEE
118views Communications» more  ICC 2008»
15 years 11 months ago
Placement of Multiple Mobile Data Collectors in Underwater Acoustic Sensor Networks
—For the sake of maximizing the network lifetime, we propose a novel placement scheme for mobile data collectors in Underwater Acoustic Sensor Networks (UASNs). Our scheme is bas...
Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein