Sciweavers

2612 search results - page 386 / 523
» Assemblies as Graph Processes
Sort
View
CP
2005
Springer
15 years 10 months ago
Approximations in Distributed Optimization
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Adrian Petcu, Boi Faltings
EMSOFT
2005
Springer
15 years 10 months ago
Communication strategies for shared-bus embedded multiprocessors
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...
Neal K. Bambha, Shuvra S. Bhattacharyya
WAC
2005
Springer
118views Communications» more  WAC 2005»
15 years 10 months ago
Towards a Reliable, Wide-Area Infrastructure for Context-Based Self-management of Communications
Abstract. In this paper we describe ConStruct, a distributed, contextaggregation based service infrastructure which supports the development of context-aware applications. ConStruc...
Graeme Stevenson, Paddy Nixon, Simon A. Dobson
JCDL
2004
ACM
94views Education» more  JCDL 2004»
15 years 10 months ago
Element matching in concept maps
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
Byron Marshall, Therani Madhusudan
138
Voted
DAGM
2004
Springer
15 years 10 months ago
Predictive Discretization During Model Selection
We present an approach to discretizing multivariate continuous data while learning the structure of a graphical model. We derive the joint scoring function from the principle of p...
Harald Steck, Tommi Jaakkola