Sciweavers

1197 search results - page 97 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
AIPS
2009
13 years 9 months ago
Incremental Policy Generation for Finite-Horizon DEC-POMDPs
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
Christopher Amato, Jilles Steeve Dibangoye, Shlomo...
CISC
2006
Springer
103views Cryptology» more  CISC 2006»
14 years 2 days ago
Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
Christophe Tartary, Huaxiong Wang
TON
2002
102views more  TON 2002»
13 years 8 months ago
A min, + system theory for constrained traffic regulation and dynamic service guarantees
By extending the system theory under the (min, +) algebra to the time-varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic ser...
Cheng-Shang Chang, Rene L. Cruz, Jean-Yves Le Boud...
CP
2006
Springer
14 years 2 days ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
SIPS
2007
IEEE
14 years 2 months ago
Dynamic Channel Flow Control of Networks-on-Chip Systems for High Buffer Efficiency
System-on-Chip (SoC) designs become more complex nowadays. The communication between each processing element often suffers challenges due to the wiring problem. Networks-on-Chip (...
Sung-Tze Wu, Chih-Hao Chao, I-Chyn Wey, An-Yeu Wu