4498 search results - page 319 / 900 » How to Invent Functions |
143
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
129
Voted
WWW
2002
ACM
16 years 5 months ago
2002
ACM
XML repositories are now a widespread means for storing and exchanging information on the Web. As these repositories become increasingly used in dynamic applications such as e-com...
254
Voted
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
249
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
139
Voted
VLSID
2009
IEEE
16 years 5 months ago
2009
IEEE
Synthesis of reversible logic has become a very important research area. In recent years several algorithms ? heuristic as well as exact ones ? have been introduced in this area. ...