Sciweavers

697 search results - page 111 / 140
» On the Theory of Average Case Complexity
Sort
View
JLP
2006
108views more  JLP 2006»
13 years 7 months ago
On testing UML statecharts
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...
Mieke Massink, Diego Latella, Stefania Gnesi
TNN
2008
97views more  TNN 2008»
13 years 7 months ago
Training Hard-Margin Support Vector Machines Using Greedy Stagewise Algorithm
Hard-margin support vector machines (HM-SVMs) suffer from getting overfitting in the presence of noise. Soft-margin SVMs deal with this problem by introducing a regularization term...
Liefeng Bo, Ling Wang, Licheng Jiao
AICOM
2002
103views more  AICOM 2002»
13 years 7 months ago
The emergent computational potential of evolving artificial living systems
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled c...
Jirí Wiedermann, Jan van Leeuwen
MOBIHOC
2010
ACM
13 years 5 months ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
SIAMNUM
2011
124views more  SIAMNUM 2011»
13 years 2 months ago
Discrete Compactness for the p-Version of Discrete Differential Forms
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
Daniele Boffi, Martin Costabel, Monique Dauge, Les...