537 search results - page 49 / 108 » A new upper bound for 3-SAT |
MST
2002
14 years 9 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
SIAMNUM
2011
14 years 4 months ago
2011
We derive energy-norm a posteriori error bounds for an Euler timestepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For acc...
CP
2003
Springer
15 years 3 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
TIT
2010
14 years 4 months ago
2010
We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario...
COMGEO
2011
ACM
14 years 5 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...