Sciweavers

1653 search results - page 151 / 331
» Directed tree-width examples
Sort
View
ARGMAS
2009
Springer
15 years 8 months ago
Burden of Proof in Deliberation Dialogs
The literature in argumentation and artificial intelligence has distinguished five types of burden of proof in persuasion dialogs, but there appears to have been no serious invest...
Douglas Walton
ICALP
1993
Springer
15 years 6 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
FMICS
2006
Springer
15 years 5 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
DMIN
2008
190views Data Mining» more  DMIN 2008»
15 years 3 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich
AIEDAM
2007
105views more  AIEDAM 2007»
15 years 2 months ago
Biomimetic design through natural language analysis to facilitate cross-domain information retrieval
Biomimetic, or biologically inspired, design uses analogous biological phenomena to develop solutions for engineering problems. Several instances of biomimetic design result from ...
Ivey Chiu, L. H. Shu