Sciweavers

3758 search results - page 336 / 752
» A Complete Subsumption Algorithm
Sort
View
PE
2006
Springer
107views Optimization» more  PE 2006»
15 years 6 months ago
Efficient steady-state analysis of second-order fluid stochastic Petri nets
This paper presents an efficient solution technique for the steady-state analysis of the second-order Stochastic Fluid Model underlying a second-order Fluid Stochastic Petri Net (...
Marco Gribaudo, Rossano Gaeta
AMAI
2005
Springer
15 years 6 months ago
Generalizations of matched CNF formulas
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
Stefan Szeider
TOG
2008
90views more  TOG 2008»
15 years 6 months ago
Interactive example-based urban layout synthesis
We present an interactive system for synthesizing urban layouts by example. Our method simultaneously performs both a structurebased synthesis and an image-based synthesis to gene...
Daniel G. Aliaga, Carlos A. Vanegas, Bedrich Benes
TPLP
2008
89views more  TPLP 2008»
15 years 6 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
SAC
2008
ACM
15 years 6 months ago
Adding background knowledge to formal concept analysis via attribute dependency formulas
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
Radim Belohlávek, Vilém Vychodil