Sciweavers

265 search results - page 52 / 53
» How to Prove Inductive Theorems
Sort
View
SAC
2004
ACM
13 years 10 months ago
A declarative framework for adaptable applications in heterogeneous environments
In this paper we present an approach for developing adaptable software applications. The problem we are facing is that of a (possibly mobile) user who wants to download and execut...
Paola Inverardi, Fabio Mancinelli, Monica Nesi
INFOCOM
2002
IEEE
13 years 10 months ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic
ATAL
2008
Springer
13 years 7 months ago
Goal generation with relevant and trusted beliefs
A rational agent adopts (or changes) its goals when new information (beliefs) becomes available or its desires (e.g., tasks it is supposed to carry out) change. In conventional ap...
Célia da Costa Pereira, Andrea Tettamanzi
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 6 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
ATAL
2010
Springer
13 years 6 months ago
Aggregating preferences in multi-issue domains by using maximum likelihood estimators
In this paper, we study a maximum likelihood estimation (MLE) approach to preference aggregation and voting when the set of alternatives has a multi-issue structure, and the voter...
Lirong Xia, Vincent Conitzer, Jérôme ...