Sciweavers

3218 search results - page 138 / 644
» Timed Extensions for SDL
Sort
View
ASPDAC
2011
ACM
207views Hardware» more  ASPDAC 2011»
14 years 8 months ago
Vertical interconnects squeezing in symmetric 3D mesh Network-on-Chip
Abstract— Three-dimensional (3D) integration and Networkon-Chip (NoC) are both proposed to tackle the on-chip interconnect scaling problems, and extensive research efforts have b...
Cheng Liu, Lei Zhang 0008, Yinhe Han, Xiaowei Li
SIGMETRICS
2012
ACM
271views Hardware» more  SIGMETRICS 2012»
13 years 7 months ago
An empirical comparison of Java remote communication primitives for intra-node data transmission
This paper presents a benchmarking suite that measures the performance of using sockets and eXtensible Markup Language remote procedure calls (XML-RPC) to exchange intra-node mess...
Philip F. Burdette, William F. Jones, Brian C. Blo...
126
Voted
IJCAI
2007
15 years 6 months ago
All Common Subsequences
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common sub...
Hui Wang
AGENTS
2001
Springer
15 years 9 months ago
Scheduling multi-task multi-agent systems
We present a centralized and a distributed algorithms for scheduling multi-task agents in heterogeneous networks. Our centralized algorithm has an upper bound on the overall compl...
Rong Xie, Daniela Rus, Clifford Stein
MP
2006
113views more  MP 2006»
15 years 4 months ago
A class of polynomially solvable linear complementarity problems
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
Teresa H. Chu