Sciweavers

10493 search results - page 45 / 2099
» Dynamic Word Problems
Sort
View
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
14 years 2 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard
NETWORKING
2007
13 years 9 months ago
Optimal Rate Allocation in Overlay Content Distribution
This paper addresses the optimal rate allocation problem in overlay content distribution for efficient utilization of limited bandwidths. We systematically present a series of opti...
Chuan Wu, Baochun Li
IPL
2008
65views more  IPL 2008»
13 years 7 months ago
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
Iain A. Stewart
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
13 years 12 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
SDM
2007
SIAM
149views Data Mining» more  SDM 2007»
13 years 9 months ago
WAT: Finding Top-K Discords in Time Series Database
Finding discords in time series database is an important problem in a great variety of applications, such as space shuttle telemetry, mechanical industry, biomedicine, and financ...
Yingyi Bu, Oscar Tat-Wing Leung, Ada Wai-Chee Fu, ...