486 search results - page 71 / 98 » Improved upper bounds for 3-SAT |
FOCS
1998
IEEE
14 years 2 days ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
COR
2004
13 years 8 months ago
2004
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
TON
1998
13 years 8 months ago
1998
—We present a scheduling protocol, called time-shift scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a predet...
HPDC
2005
IEEE
14 years 2 months ago
2005
IEEE
Mega grids span several continents and may consist of millions of nodes and billions of tasks executing at any point in time. This setup calls for scalable and highly available re...