162 search results - page 8 / 33 » Study of Lower Bound Functions for MAX-2-SAT |
161
click to vote
SIROCCO
2007
15 years 7 months ago
2007
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
139
click to vote
AAAI
2007
15 years 8 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
170
click to vote
ATAL
2009
Springer
16 years 15 days ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
136
click to vote
COLT
2008
Springer
15 years 7 months ago
2008
Springer
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
149
click to vote
IPL
2007
15 years 5 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...