Sciweavers

398 search results - page 44 / 80
» Critical exponents of graphs
Sort
View
77
Voted
MICRO
2006
IEEE
100views Hardware» more  MICRO 2006»
15 years 6 months ago
Serialization-Aware Mini-Graphs: Performance with Fewer Resources
Instruction aggregation—the grouping of multiple operations into a single processing unit—is a technique that has recently been used to amplify the bandwidth and capacity of c...
Anne Bracy, Amir Roth
94
Voted
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 4 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
94
Voted
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
15 years 7 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini
123
Voted
SC
2003
ACM
15 years 6 months ago
Traffic-based Load Balance for Scalable Network Emulation
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...
Xin Liu, Andrew A. Chien
ICALT
2006
IEEE
15 years 6 months ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan