Sciweavers

7123 search results - page 308 / 1425
» The Ordered Set of Rough Sets
Sort
View
CN
2007
99views more  CN 2007»
15 years 6 months ago
Reducing the cost of applying adaptive test cases
The testing of a state-based system may involve the application of a number of adaptive test cases. Where the implementation under test (IUT) is deterministic, the response of the...
Robert M. Hierons, Hasan Ural
JAPLL
2006
114views more  JAPLL 2006»
15 years 6 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
EOR
2007
111views more  EOR 2007»
15 years 6 months ago
A pegging approach to the precedence-constrained knapsack problem
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
Byungjun You, Takeo Yamada
INFSOF
2007
148views more  INFSOF 2007»
15 years 6 months ago
Mutating database queries
A set of mutation operators for SQL queries that retrieve information from a database is developed and tested against a set of queries drawn from the NIST SQL Conformance Test Sui...
Javier Tuya, María José Suáre...
DKE
2002
94views more  DKE 2002»
15 years 6 months ago
Tie-breaking strategies for fast distance join processing
The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a pri...
Hyoseop Shin, Bongki Moon, Sukho Lee