175 search results - page 20 / 35 » Informed Lifting for Message-Passing |
159
click to vote
JPDC
2007
14 years 11 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
JMLR
2010
14 years 6 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
ICCS
2009
Springer
15 years 6 months ago
2009
Springer
My paper discusses system consequence, which is a central idea in the project to lift the theory of information flow to the general level of universal logic and the theory of ins...
101
click to vote
LCTRTS
2009
Springer
15 years 6 months ago
2009
Springer
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...