Sciweavers

1628 search results - page 247 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
CF
2006
ACM
14 years 3 months ago
Tile size selection for low-power tile-based architectures
In this paper, we investigate the power implications of tile size selection for tile-based processors. We refer to this investigation as a tile granularity study. This is accompli...
John Oliver, Ravishankar Rao, Michael Brown, Jenni...
MSWIM
2006
ACM
14 years 3 months ago
Interference-constrained wireless coverage in a protocol model
We present an efficient algorithm to compute the coverage map of a given set of transmitters under interference constraints. That is, we compute the set of points that lie within ...
Prateek R. Kapadia, Om P. Damani
CLUSTER
2005
IEEE
14 years 3 months ago
Efficient and Robust Computation of Resource Clusters in the Internet
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster
ANOR
2002
128views more  ANOR 2002»
13 years 9 months ago
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search
The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set of crew members such that a set of activities is partitioned and the costs for that assignmen...
Meinolf Sellmann, Kyriakos Zervoudakis, Panagiotis...
ACTA
2000
92views more  ACTA 2000»
13 years 9 months ago
How to Calculate Symmetries of Petri Nets
Symmetric net structure yields symmetric net behaviour. Thus, knowing the symmetries of a net, redundant calculations can be skipped. We present a framework for the calculation of ...
Karsten Schmidt 0004