5214 search results - page 79 / 1043 » The Online Specialization Problem |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
CGO
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Online optimization allows the continuous restructuring and adaptation of an executing application using live information about its execution environment. The further ad...
SIGUCCS
2005
ACM
14 years 1 months ago
2005
ACM
Many higher education institutions are searching for cost effective tools for the delivery of a feature rich, synchronous online learning environment. While there are several comm...