Sciweavers

2531 search results - page 47 / 507
» Group testing in graphs
Sort
View
ISSRE
2006
IEEE
14 years 4 months ago
BPEL4WS Unit Testing: Test Case Generation Using a Concurrent Path Analysis Approach
BPEL is a language that could express complex concurrent behaviors. This paper presents a novel method of BPEL test case generation, which is based on concurrent path analysis. Th...
Jun Yan, Zhong Jie Li, Yuan Yuan, Wei Sun, Jian Zh...
CP
2009
Springer
14 years 11 months ago
Propagator Groups
This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constr...
Mikael Z. Lagerkvist, Christian Schulte
ASPDAC
2007
ACM
101views Hardware» more  ASPDAC 2007»
14 years 2 months ago
Core-Based Testing of Multiprocessor System-on-Chips Utilizing Hierarchical Functional Buses
Abstract--An integrated test scheduling methodology for multiprocessor System-on-Chips (SOC) utilizing the functional buses for test data delivery is described. The proposed method...
Fawnizu Azmadi Hussin, Tomokazu Yoneda, Alex Orail...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 4 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
TALG
2008
69views more  TALG 2008»
13 years 10 months ago
Testing Euclidean minimum spanning trees in the plane
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
Artur Czumaj, Christian Sohler