1884 search results - page 133 / 377 » Simple Algorithm for Simple Timed Games |
100
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
127
Voted
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
DCG
2010
15 years 2 months ago
2010
An essential cycle on a surface is a simple cycle that cannot be continuously deformed to a point or a single boundary. We describe algorithms to compute the shortest essential cy...
134
click to vote
FSTTCS
2010
Springer
15 years 12 days ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
109
click to vote
DDECS
2007
IEEE
15 years 8 months ago
2007
IEEE
—An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. A commonly used repair strategy is to equip memories with sp...