4860 search results - page 389 / 972 » SNPs Problems, Complexity, and Algorithms |
150
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
178
click to vote
CCE
2008
15 years 6 months ago
2008
Scheduling of processes in mixed batch/continuous plants, due to their hybrid nature can become very complex. This paper presents the Timed Hybrid Petri net (THPN) as a suitable t...
194
click to vote
FSTTCS
2010
Springer
15 years 4 months 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...
178
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
178
click to vote
FORTE
2007
15 years 8 months ago
2007
Abstract. We present a formal specification and analysis of a faulttolerant DHCP algorithm, used to automatically configure certain host parameters in an IP network. Our algorith...