Sciweavers

279 search results - page 28 / 56
» Timed Concurrent Game Structures
Sort
View
ICALP
2010
Springer
14 years 1 months ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot
CONCURRENCY
2006
140views more  CONCURRENCY 2006»
13 years 8 months ago
An efficient memory operations optimization technique for vector loops on Itanium 2 processors
To keep up with a large degree of instruction level parallelism (ILP), the Itanium 2 cache systems use a complex organization scheme: load/store queues, banking and interleaving. ...
William Jalby, Christophe Lemuet, Sid Ahmed Ali To...
IPPS
1999
IEEE
14 years 28 days ago
Hiding Communication Latency in Reconfigurable Message-Passing Environments
Communication overhead is one of the most important factors affecting the performance of message passing multicomputers. We present evidence (through the analysis of several paral...
Ahmad Afsahi, Nikitas J. Dimopoulos
AGTIVE
2007
Springer
14 years 2 months ago
Programmed Graph Rewriting with DEVS
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
Eugene Syriani, Hans Vangheluwe
ECAI
2006
Springer
14 years 10 days ago
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
Viet Dung Dang, Nicholas R. Jennings