Sciweavers

1297 search results - page 161 / 260
» Dynamic Object Process Graphs
Sort
View
CP
2005
Springer
15 years 6 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
WAC
2005
Springer
118views Communications» more  WAC 2005»
15 years 6 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
127
Voted
IWCMC
2010
ACM
15 years 5 months ago
Group detection in mobility traces
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
Yung-Chih Chen, Elisha J. Rosensweig, Jim Kurose, ...
104
Voted
DSS
2007
94views more  DSS 2007»
15 years 18 days ago
A formal modeling approach for supply chain event management
: As supply chains become more dynamic it is important to be able to model them formally as business processes. In particular, there is a need for a sense and respond capability to...
Rong Liu, Akhil Kumar, Wil M. P. van der Aalst
201
Voted
ICDE
2007
IEEE
109views Database» more  ICDE 2007»
16 years 2 months ago
Evaluating Proximity Relations Under Uncertainty
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
Zhengdao Xu, Hans-Arno Jacobsen