Sciweavers

9572 search results - page 255 / 1915
» Cover Algorithms and Their Combination
Sort
View
AMOST
2005
ACM
16 years 3 days ago
Modeling requirements for combinatorial software testing
The combinatorial approach to software testing uses models to generate a minimal number of test inputs so that selected combinations of input values are covered. The most common c...
Christopher M. Lott, Ashish Jain, Siddhartha R. Da...
FM
2005
Springer
89views Formal Methods» more  FM 2005»
16 years 2 days ago
Control Law Diagrams in Circus
Abstract. Control diagrams are routinely used by engineers in the design of control systems. Yet, currently the formal verification of programs that implement the diagrams is a ch...
Ana Cavalcanti, Phil Clayton, Colin O'Halloran
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
ACL
2011
14 years 10 months ago
Binarized Forest to String Translation
Tree-to-string translation is syntax-aware and efficient but sensitive to parsing errors. Forestto-string translation approaches mitigate the risk of propagating parser errors in...
Hao Zhang, Licheng Fang, Peng Xu, Xiaoyun Wu
ICCCN
2008
IEEE
16 years 1 months ago
p-Percent Coverage Schedule in Wireless Sensor Networks
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
Shan Gao, Xiaoming Wang, Yingshu Li