Sciweavers

9842 search results - page 153 / 1969
» Problem complexity
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 15 days ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
14 years 11 months ago
Blocking parameterizations for improving the computational tractability of affine disturbance feedback MPC problems
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
Frauke Oldewurtel, Ravi Gondhalekar, Colin Neil Jo...
WCC
2005
Springer
117views Cryptology» more  WCC 2005»
15 years 3 months ago
Interpolation of Functions Related to the Integer Factoring Problem
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
Clemens Adelmann, Arne Winterhof
EOR
2011
131views more  EOR 2011»
14 years 1 months ago
Personnel scheduling: Models and complexity
Due to its complexity, its challenging features, and its practical relevance, personnel scheduling has been heavily investigated in the last few decades. However, there is a relati...
Peter Brucker, Rong Qu, Edmund K. Burke
IWPEC
2009
Springer
15 years 4 months ago
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
Gregory Gutin, Eun Jung Kim, Stefan Szeider, Ander...