Sciweavers

413 search results - page 60 / 83
» On Solving Geometric Optimization Problems Using Shortest Pa...
Sort
View
PDPTA
2007
13 years 9 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker
NOMS
2008
IEEE
14 years 2 months ago
A novel approach to bottleneck analysis in networks
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...
Nikhil Shetty, Assane Gueye, Jean C. Walrand
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
13 years 12 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
DCOSS
2009
Springer
14 years 2 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
ICAI
2004
13 years 9 months ago
Task Oriented Machine-Learning and Review
We propose an optimization algorithm to execute a previously unlearned task-oriented command in an intelligent machine. We show that a well-defined, physically bounded, task-orien...
Pierre Abdelmalek, Howard E. Michel