2194 search results - page 178 / 439 » Improving HLRTA*( k ) |
113
click to vote
MP
2007
15 years 1 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
137
click to vote
PPOPP
2010
ACM
14 years 12 months ago
2010
ACM
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
119
click to vote
RFIDSEC
2010
14 years 12 months ago
2010
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
134
Voted
RSA
2010
14 years 12 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
137
click to vote
SAT
2010
Springer
14 years 12 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...