Sciweavers

53 search results - page 6 / 11
» New Lower Bounds of Constraint Violations for Over-Constrain...
Sort
View
AAAI
2008
13 years 9 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
CRYPTO
1992
Springer
168views Cryptology» more  CRYPTO 1992»
13 years 11 months ago
Threshold Schemes with Disenrollment
Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of broadcast messages in threshold schemes with disenrollment. In an effort to examine the conjecture, w...
Bob Blakley, G. R. Blakley, Agnes Hui Chan, James ...
CCO
2001
Springer
157views Combinatorics» more  CCO 2001»
13 years 12 months ago
Lagrangian Relaxation
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
Claude Lemaréchal
IJMC
2006
84views more  IJMC 2006»
13 years 7 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
MASS
2010
13 years 5 months ago
You can't get there from here: Sensor scheduling with refocusing delays
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...
Yosef Alayev, Amotz Bar-Noy, Matthew P. Johnson, L...