2252 search results - page 263 / 451 » Lower Bounds for Dynamic Algorithms |
190
click to vote
COCO
2007
Springer
16 years 21 days ago
2007
Springer
Motivated by the study of Parallel Repetition and also by the Unique Games Conjecture, we investigate the value of the “Odd Cycle Games” under parallel repetition. Using tools...
153
click to vote
QEST
2006
IEEE
16 years 16 days ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
172
click to vote
SIGECOM
2005
ACM
16 years 2 days ago
2005
ACM
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
175
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
211
click to vote
ALT
1999
Springer
15 years 10 months ago
1999
Springer
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...