Sciweavers

20294 search results - page 256 / 4059
» Algorithmic Information Theory
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Divide-and-coordinate: DCOPs by agreement
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
Meritxell Vinyals, Marc Pujol, Juan A. Rodrí...
CIKM
2009
Springer
16 years 23 days ago
A query model based on normalized log-likelihood
Leveraging information from relevance assessments has been proposed as an effective means for improving retrieval. We introduce a novel language modeling method which uses inform...
Edgar Meij, Wouter Weerkamp, Maarten de Rijke
149
Voted
SYNASC
2007
IEEE
138views Algorithms» more  SYNASC 2007»
16 years 14 days ago
Some Applications of Weakly Picard Operators
Abstract. In this paper we give some applications of weakly Picard operators theory to linear positive approximation operators, to difference equations with deviating argument and...
Ioan A. Rus
BPM
2006
Springer
111views Business» more  BPM 2006»
15 years 8 months ago
Process Mining and Petri Net Synthesis
The theory of regions and the algorithms for synthesizing a Petri net model from a transition system, which are based on this theory, have interesting practical applications
Ekkart Kindler, Vladimir Rubin, Wilhelm Schäf...
151
Voted
DM
2008
123views more  DM 2008»
15 years 6 months ago
Graphic sequences with a realization containing a generalized friendship graph
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
Jian-Hua Yin, Gang Chen, John R. Schmitt