Sciweavers

3897 search results - page 715 / 780
» complexity 2010
Sort
View
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
14 years 24 days ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
14 years 24 days ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
DIAGRAMS
2010
Springer
14 years 24 days ago
Drawing Area-Proportional Venn-3 Diagrams with Convex Polygons
Abstract. Area-proportional Venn diagrams are a popular way of visualizing the relationships between data sets, where the set intersections have a specified numerical value. In th...
Peter Rodgers, Jean Flower, Gem Stapleton, John Ho...
ICDCS
2010
IEEE
14 years 24 days ago
Stochastic Steepest-Descent Optimization of Multiple-Objective Mobile Sensor Coverage
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
ICDCS
2010
IEEE
14 years 24 days ago
Extracting More Capacity from Multi-channel Multi-radio Wireless Networks by Exploiting Power
—Transmission power plays a crucial role in the design and performance of wireless networks. The issue is therefore complex since an increase in transmission power implies that a...
Devu Manikantan Shila, Yu Cheng, Tricha Anjali, Pe...