5889 search results - page 446 / 1178 » Graph Layout Problems |
243
Voted
MOBICOM
2006
ACM
16 years 1 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
196
click to vote
AAAI
1998
15 years 9 months ago
1998
This paper discusses the design and implementation of ESSPL, an expert system which generates security plans for alarm systems (Figure 1). Security planning is the task of determi...
218
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this study, we investigate the task scheduling problem in heterogeneous computing environments and propose a novel scheduling algorithm, called the Artificial Immune System wit...
155
click to vote
CPAIOR
2007
Springer
16 years 1 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
174
click to vote
GD
2007
Springer
16 years 1 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...