432 search results - page 9 / 87 » Internally deterministic parallel algorithms can be fast |
82
Voted
JAIR
2000
14 years 9 months ago
2000
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
BMCBI
2005
14 years 9 months ago
2005
Background: Peptide Mass Fingerprinting (PMF) is a widely used mass spectrometry (MS) method of analysis of proteins and peptides. It relies on the comparison between experimental...