Sciweavers

1080 search results - page 54 / 216
» Problem dependent optimization (PDO)
Sort
View
STACS
1999
Springer
15 years 8 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
COR
2006
129views more  COR 2006»
15 years 4 months ago
Game-theoretic analysis of an ancient Chinese horse race problem
This paper analyzes a legendary Chinese horse race problem involving the King of Qi and General Tianji which took place more than 2000 years ago. In this problem each player owns ...
Mingming Leng, Mahmut Parlar
WWW
2007
ACM
16 years 4 months ago
Long distance wireless mesh network planning: problem formulation and solution
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
Sayandeep Sen, Bhaskaran Raman
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
15 years 10 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
Adi Akavia
PE
2011
Springer
266views Optimization» more  PE 2011»
14 years 11 months ago
Lumping partially symmetrical stochastic models
Performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their stat...
Souheib Baarir, Marco Beccuti, Claude Dutheillet, ...