Sciweavers

920 search results - page 116 / 184
» Generating Satisfiable Problem Instances
Sort
View
102
Voted
TKDE
2008
125views more  TKDE 2008»
15 years 18 days ago
Discovering and Explaining Abnormal Nodes in Semantic Graphs
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
Shou-de Lin, Hans Chalupsky
110
Voted
TEC
2008
118views more  TEC 2008»
15 years 18 days ago
RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m...
Qingfu Zhang, Aimin Zhou, Yaochu Jin
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
15 years 6 months ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...
IJACT
2008
64views more  IJACT 2008»
15 years 21 days ago
An efficient one-move Nominative Signature scheme
Abstract. A signer in a Nominative Signature (NS) scheme can arbitrarily choose a nominee, then jointly generate a signature in such a way that the signature can only be verified w...
Qiong Huang, Dennis Y. W. Liu, Duncan S. Wong
TVLSI
2008
151views more  TVLSI 2008»
15 years 17 days ago
Guest Editorial Special Section on Design Verification and Validation
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
I. Harris, D. Pradhan