Sciweavers

1497 search results - page 87 / 300
» A Computational Model for Message Passing
Sort
View
MDAI
2009
Springer
14 years 3 months ago
Using Conditional Random Fields for Decision-Theoretic Planning
We propose a means of extending Conditional Random Field modeling to decision-theoretic planning where valuation is dependent upon fullyobservable factors. Representation is discu...
Paul A. Ardis, Christopher M. Brown
IDEAS
2006
IEEE
218views Database» more  IDEAS 2006»
14 years 3 months ago
PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
Ashwani Garg, Ashish Mangla, Neelima Gupta, Vasudh...
SIGOPSE
1992
ACM
14 years 24 days ago
System support for shared objects
This position paper supports the view that a model based on shared objects is an attractive alternative to message passing for structuring distributed applications and that a distr...
Pierre-Yves Chevalier, Daniel Hagimont, Sacha Krak...
COORDINATION
2007
Springer
14 years 3 months ago
Requirements for Routing in the Application Layer
In the application layer of networks, many application servers are middleboxes in the paths of messages from source to destination. Applications require, as a basic coordination me...
Pamela Zave
CISIS
2010
IEEE
14 years 4 months ago
On a Journey from Message to Observable Pervasive Application
—Bringing together heterogeneous computing devices and appliances gives rise to a spontaneous environment where resources exchange messages, such as a mobile phone telling the ca...
Geert Vanderhulst, Kris Luyten, Karin Coninx