Sciweavers

10493 search results - page 184 / 2099
» Dynamic Word Problems
Sort
View
CORR
2011
Springer
209views Education» more  CORR 2011»
12 years 12 months ago
Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems
In this work, we consider a retailer selling a single product with limited on-hand inventory over a finite selling season. Customer demand arrives according to a Poisson process,...
Zizhuo Wang, Shiming Deng, Yinyu Ye
NETWORKING
2011
12 years 11 months ago
The Problem of Sensing Unused Cellular Spectrum
Abstract. Sensing mechanisms that estimate the occupancy of wireless spectrum are crucial to the success of approaches based on Dynamic Spectrum Access. In this paper, we present k...
Daniel Willkomm, Sridhar Machiraju, Jean Bolot, Ad...
JDA
2010
122views more  JDA 2010»
13 years 3 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
13 years 9 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 8 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová