Sciweavers

14165 search results - page 376 / 2833
» The generalized two-server problem
Sort
View
TCS
2008
15 years 6 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh
COCOON
2004
Springer
16 years 4 days ago
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudenc...
CORR
2002
Springer
98views Education» more  CORR 2002»
15 years 6 months ago
Two Representations for Iterative Non-prioritized Change
We address a general representation problem for belief change, and describe two interrelated representations for iterative nonprioritized change: a logical representation in terms...
Alexander Bochman
MOC
2000
75views more  MOC 2000»
15 years 6 months ago
Multihomogeneous Newton methods
Abstract. We study multihomogeneous analytic functions and a multihomogeneous Newton's method for finding their zeros. We give a convergence result for this iteration and we s...
Jean-Pierre Dedieu, Mike Shub
TIT
1998
106views more  TIT 1998»
15 years 6 months ago
About the Asymptotic Accuracy of Barron Density Estimates
—By extending the information-theoretic arguments of previous papers dealing with the Barron-type density estimates, and their consistency in information divergence and chi-squar...
Alain Berlinet, Igor Vajda, Edward C. van der Meul...