Sciweavers

1016 search results - page 105 / 204
» Parallelism Constraints
Sort
View
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 9 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
DCOSS
2011
Springer
12 years 8 months ago
STARS: Static relays for multi-robot real-time search and monitoring
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
Yuanteng Pei, Matt W. Mutka
IOR
2007
106views more  IOR 2007»
13 years 8 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
SIGGRAPH
1999
ACM
14 years 1 months ago
Shape Transformation Using Variational Implicit Functions
Traditionally, shape transformation using implicit functions is performed in two distinct steps: 1) creating two implicit functions, and 2) interpolating between these two functio...
Greg Turk, James F. O'Brien
EUROPAR
2006
Springer
14 years 19 days ago
Multi-dimensional Kernel Generation for Loop Nest Software Pipelining
Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multi-dimensional loops [16]. This paper introduces for the first tim...
Alban Douillet, Hongbo Rong, Guang R. Gao