Sciweavers

306 search results - page 32 / 62
» From Preference Logics to Preference Languages, and Back
Sort
View
LOPSTR
2009
Springer
14 years 5 days ago
Towards a Framework for Constraint-Based Test Case Generation
In this paper, we propose an approach for automated test case generation based on techniques from constraint programming (CP). We advocate the use of standard CP search strategies ...
François Degrave, Tom Schrijvers, Wim Vanho...
ECSQARU
2009
Springer
13 years 11 months ago
Knowledge Base Stratification and Merging Based on Degree of Support
Most operators for merging multiple knowledge bases (where each is a set of formulae) aim to produce a knowledge base as output that best reflects the information available in the ...
Anthony Hunter, Weiru Liu
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
14 years 4 months ago
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
Hsuan-Po Lin, Jie-Hong Roland Jiang, Ruei-Rung Lee
HT
2005
ACM
14 years 1 months ago
Information visualization for an intrusion detection system
— Spatial hypertext was developed from studies of how humans deal with information overflow particularly in situations where data needed to be interpreted quickly. Intrusion det...
James Blustein, Ching-Lung Fu, Daniel L. Silver
ATAL
2005
Springer
14 years 1 months ago
Allocation of indivisible goods: a general model and some complexity results
Many industrial or research activities are so expensive that it is often benefitable for the involved agents to cofund the construction or the purchase of a common required resou...
Sylvain Bouveret, Michel Lemaître, Hé...