3204 search results - page 197 / 641 » The Alcuin Number of a Graph |
178
click to vote
ICCAD
2003
IEEE
16 years 2 months ago
2003
IEEE
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
163
click to vote
LATIN
2010
Springer
16 years 26 days ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
131
click to vote
ESA
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
148
click to vote
CSMR
2008
IEEE
16 years 15 days ago
2008
IEEE
Databases are continuously evolving environments, where design constructs are added, removed or updated rather often. Small changes in the database configurations might impact a l...
160
click to vote
ICC
2007
IEEE
16 years 11 days ago
2007
IEEE
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...