Sciweavers

603 search results - page 18 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
15 years 6 months ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...
DAC
1998
ACM
15 years 5 months ago
Approximate Reachability with BDDs Using Overlapping Projections
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...
Shankar G. Govindaraju, David L. Dill, Alan J. Hu,...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 10 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
15 years 6 months ago
Fault tolerant control allocation for a thruster-controlled floating platform using parametric programming
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...
Jørgen Spjøtvold, Tor Arne Johansen
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
15 years 5 months ago
Approximation Schemes for Euclidean k-Medians and Related Problems
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
Sanjeev Arora, Prabhakar Raghavan, Satish Rao