Sciweavers

1084 search results - page 18 / 217
» Optimal worm-scanning method using vulnerable-host distribut...
Sort
View
SAB
2010
Springer
226views Optimization» more  SAB 2010»
13 years 6 months ago
Distributed Online Learning of Central Pattern Generators in Modular Robots
Abstract. In this paper we study distributed online learning of locomotion gaits for modular robots. The learning is based on a stochastic approximation method, SPSA, which optimiz...
David Johan Christensen, Alexander Spröwitz, ...
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
12 years 3 months ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang
CLADE
2004
IEEE
13 years 11 months ago
An on Demand Path Marking and Capacity Reservation Method using Split Agent
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
Constandinos X. Mavromoustakis, Helen D. Karatza
IOR
2007
58views more  IOR 2007»
13 years 7 months ago
Bounds, Heuristics, and Approximations for Distribution Systems
This paper develops simple approximate methods to analyze a two-stage stochastic distribution system consisting of one warehouse and multiple retailers. We consider local and cent...
Guillermo Gallego, Özalp Özer, Paul H. Z...
ICASSP
2011
IEEE
12 years 11 months ago
A-Functions: A generalization of Extended Baum-Welch transformations to convex optimization
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
Dimitri Kanevsky, David Nahamoo, Tara N. Sainath, ...