2095 search results - page 38 / 419 » Improved pebbling bounds |
COCOON
2004
Springer
14 years 3 months ago
2004
Springer
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
JAT
2010
13 years 8 months ago
2010
We present error bounds for the interpolation with anisotropically transformed radial basis functions for both function and its partial derivatives. The bounds rely on a growth fu...
CG
2010
Springer
13 years 8 months ago
2010
Springer
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
CODES
2007
IEEE
14 years 4 months ago
2007
IEEE
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...