Sciweavers

5210 search results - page 856 / 1042
» Computing Capabilities of Mediators
Sort
View
INFOCOM
2010
IEEE
15 years 5 months ago
Distributed Resource Allocation for Synchronous Fork and Join Processing Networks
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
KAIS
2010
139views more  KAIS 2010»
15 years 5 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
MP
2010
145views more  MP 2010»
15 years 4 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
NA
2010
82views more  NA 2010»
15 years 4 months ago
Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
Matthew M. Lin, Bo Dong, Moody T. Chu
PAAMS
2010
Springer
15 years 4 months ago
A GPU-Based Multi-agent System for Real-Time Simulations
The huge number of cores existing in current Graphics Processor Units (GPUs) provides these devices with computing capabilities that can be exploited by distributed applications. I...
Guillermo Vigueras, Juan M. Orduña, Miguel ...