Sciweavers

952 search results - page 46 / 191
» Computational complexity of stochastic programming problems
Sort
View
DATE
2010
IEEE
140views Hardware» more  DATE 2010»
14 years 4 months ago
Variation-aware interconnect extraction using statistical moment preserving model order reduction
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...
Tarek A. El-Moselhy, Luca Daniel
ICALP
2005
Springer
14 years 4 months ago
Decidability and Complexity Results for Timed Automata via Channel Machines
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
Parosh Aziz Abdulla, Johann Deneux, Joël Ouak...
ILP
2004
Springer
14 years 4 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
CEC
2008
IEEE
14 years 5 months ago
Potential and dynamics-based Particle Swarm Optimization
Abstract— The Particle Swarm Optimization (PSO) algorithm is a robust stochastic evolutionary computation technique based on the movement and intelligence of swarms. This paper p...
Hyungmin Park, Jong-Hwan Kim
ICRA
2005
IEEE
129views Robotics» more  ICRA 2005»
14 years 4 months ago
Dynamic Programming in Reduced Dimensional Spaces: Dynamic Planning For Robust Biped Locomotion
— We explore the use of computational optimal control techniques for automated construction of policies in complex dynamic environments. Our implementation of dynamic programming...
Mike Stilman, Christopher G. Atkeson, James Kuffne...