10146 search results - page 1753 / 2030 » Fast FAST |
146
click to vote
ANOR
2011
14 years 8 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
153
Voted
CAV
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
213
click to vote
CGO
2011
IEEE
14 years 8 months ago
2011
IEEE
—Memory corruption, reading uninitialized memory, using freed memory, and other memory-related errors are among the most difficult programming bugs to identify and fix due to t...
221
click to vote
CJ
2011
14 years 8 months ago
2011
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/...
180
click to vote
CODCRY
2011
Springer
14 years 8 months ago
2011
Springer
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...