5138 search results - page 560 / 1028 » Randomized Algorithms for 3-SAT |
164
click to vote
COCO
2005
Springer
16 years 12 days ago
2005
Springer
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...
179
Voted
AP2PC
2004
Springer
16 years 8 days ago
2004
Springer
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
131
Voted
ATAL
2004
Springer
16 years 8 days ago
2004
Springer
Despite the recent advances in distributed MDP frameworks for reasoning about multiagent teams, these frameworks mostly do not reason about resource constraints, a crucial issue i...
181
click to vote
CSB
2003
IEEE
16 years 4 days ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
146
click to vote
DATE
2003
IEEE
16 years 4 days ago
2003
IEEE
Test pattern decompression techniques are bounded with the algorithm of test pattern ordering and test data flow controlling. Some of the methods could have more sophisticated sor...