400 search results - page 37 / 80 » Hard Problem Generation for MKP |
127
Voted
SIGOPSE
1998
ACM
15 years 5 months ago
1998
ACM
with this, the thread abstraction was introduced. While threads are handling events, or awaiting specific events, unrelated events can be handled by other threads. Unfortunately, ...
93
Voted
ICDCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Peer-to-peer file sharing is popular, but it generates random write traffic to storage due to the nature of swarming. NAND flash memory based Solid-State Drive (SSD) technology...
109
Voted
ICC
2008
IEEE
15 years 7 months ago
2008
IEEE
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
101
Voted
UIST
2006
ACM
15 years 6 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
92
Voted
ANTS
2004
Springer
15 years 6 months ago
2004
Springer
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....