Sciweavers

520 search results - page 83 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
BMCBI
2010
155views more  BMCBI 2010»
15 years 18 days ago
A flexible R package for nonnegative matrix factorization
Background: Nonnegative Matrix Factorization (NMF) is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face re...
Renaud Gaujoux, Cathal Seoighe
CTRS
1990
15 years 4 months ago
Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Maria Paola Bonacina, Jieh Hsiang
102
Voted
JUCS
2007
152views more  JUCS 2007»
15 years 11 days ago
The SEWASIE Network of Mediator Agents for Semantic Search
: Integration of heterogeneous information in the context of Internet becomes a key activity to enable a more organized and semantically meaningful access to data sources. As Inter...
Domenico Beneventano, Sonia Bergamaschi, Francesco...
147
Voted
AMAI
1999
Springer
15 years 5 days ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
96
Voted
JCT
2011
141views more  JCT 2011»
14 years 7 months ago
Bijections for Baxter families and related objects
The Baxter number Bn can be written as Bn = n k=0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1)2 (k + 2) k + ℓ k k + ℓ + 1 k k + ℓ + 2 k . These numbers have first appeared in the...
Stefan Felsner, Éric Fusy, Marc Noy, David ...