Sciweavers

537 search results - page 30 / 108
» Methods for Evolving Robust Programs
Sort
View
AUTOMATICA
2007
72views more  AUTOMATICA 2007»
13 years 9 months ago
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
Giuseppe C. Calafiore, Fabrizio Dabbene
JSAC
2010
153views more  JSAC 2010»
13 years 4 months ago
Autonomic traffic engineering for network robustness
Abstract--The continuously increasing complexity of communication networks and the increasing diversity and unpredictability of traffic demand has led to a consensus view that the ...
Ali Tizghadam, Alberto Leon-Garcia
ISVC
2005
Springer
14 years 2 months ago
A Hybrid HMM/DPA Adaptive Gesture Recognition Method
We present a hybrid classification method applicable to gesture recognition. The method combines elements of Hidden Markov Models (HMM) and various Dynamic Programming Alignment (...
Stjepan Rajko, Gang Qian
PAKDD
2007
ACM
203views Data Mining» more  PAKDD 2007»
14 years 3 months ago
Grammar Guided Genetic Programming for Flexible Neural Trees Optimization
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
Peng Wu, Yuehui Chen
BIRTHDAY
2008
Springer
13 years 11 months ago
Session and Union Types for Object Oriented Programming
In network applications it is crucial to have a mechanism to guarantee that communications evolve correctly according to the agreed protocol. Session types offer a method for abstr...
Lorenzo Bettini, Sara Capecchi, Mariangiola Dezani...