3082 search results - page 61 / 617 » New Bounds for the Controller Problem |
134
Voted
UAI
2003
15 years 5 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
144
click to vote
SODA
1992
ACM
15 years 5 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
106
Voted
IPL
2008
15 years 3 months ago
2008
In the context of scheduling, we study social cost efficiency for a cost-sharing problem in which the service provider's cost is determined by the makespan of the served agen...
135
Voted
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
146
Voted
CCR
2006
15 years 3 months ago
2006
We consider the uplink power control problem in a single cell CDMA wireless data system. Each user specifies upper and lower QoS bounds. We formulate the considered problem as a g...