1002 search results - page 98 / 201 » Towards Graph Programs for Graph Algorithms |
153
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
170
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
115
click to vote
IPPS
1994
IEEE
15 years 8 months ago
1994
IEEE
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
136
click to vote
DLOG
2004
15 years 5 months ago
2004
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
141
click to vote
FLAIRS
2006
15 years 5 months ago
2006
Intelligent Tutoring Systems, while effective at producing student learning [2,7], are notoriously costly to construct [1,9], and require PhD level experience in cognitive science...