Sciweavers

1857 search results - page 208 / 372
» Minimum Degree Orderings
Sort
View
AAAI
1996
15 years 7 months ago
Is "Early Commitment" in Plan Generation Ever a Good Idea?
Partial-Order Causal Link planners typically take a "least-commitment" approach to some decisions (notably, step ordering), postponing those decisions until constraints ...
David Joslin, Martha E. Pollack
RECSYS
2010
ACM
15 years 6 months ago
Nantonac collaborative filtering: a model-based approach
A recommender system has to collect users' preference data. To collect such data, rating or scoring methods that use rating scales, such as good-fair-poor or a five-point-sca...
Toshihiro Kamishima, Shotaro Akaho
JUCS
2006
108views more  JUCS 2006»
15 years 6 months ago
Development of Ambient Intelligence Applications using Components and Aspects
: In recent times, interest in Ambient Intelligence (or AmI) has increased considerably. One of the main challenges in the development of these systems is to improve their modulari...
Lidia Fuentes, Daniel Jiménez, Mónic...
TCS
2008
15 years 6 months ago
On a quasi-ordering on Boolean functions
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
Miguel Couceiro, Maurice Pouzet
JCT
1998
100views more  JCT 1998»
15 years 6 months ago
2-Partition-Transitive Tournaments
Given a tournament score sequence s1 ≥ s2 ≥ · · · ≥ sn, we prove that there exists a tournament T on vertex set {1, 2, . . . , n} such that the degree of any vertex i is ...
Barry Guiduli, András Gyárfás...