Sciweavers

941 search results - page 41 / 189
» Efficient Testing of Large Graphs
Sort
View
CORR
2006
Springer
90views Education» more  CORR 2006»
14 years 9 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
ATVA
2006
Springer
191views Hardware» more  ATVA 2006»
15 years 1 months ago
Automatic Verification of Hybrid Systems with Large Discrete State Space
We address the problem of model checking hybrid systems which exhibit nontrivial discrete behavior and thus cannot be treated by considering the discrete states one by one, as most...
Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang,...
NIPS
2003
14 years 11 months ago
Unsupervised Context Sensitive Language Acquisition from a Large Corpus
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...
Zach Solan, David Horn, Eytan Ruppin, Shimon Edelm...
AUTOMATICA
2006
106views more  AUTOMATICA 2006»
14 years 9 months ago
Decentralized receding horizon control for large scale dynamically decoupled systems
A detailed study on the design of decentralized Receding Horizon Control (RHC) schemes for decoupled systems is presented. An optimal control problem is formulated for a set of de...
Tamás Keviczky, Francesco Borrelli, Gary J....
PTS
2007
144views Hardware» more  PTS 2007»
14 years 11 months ago
Component Testing Is Not Enough - A Study of Software Faults in Telecom Middleware
The interrelationship between software faults and failures is quite intricate and obtaining a meaningful characterization of it would definitely help the testing community in decid...
Sigrid Eldh, Sasikumar Punnekkat, Hans Hansson, Pe...