Sciweavers

2477 search results - page 204 / 496
» Approximate extended formulations
Sort
View
FOCS
2007
IEEE
15 years 8 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
EDBT
2009
ACM
119views Database» more  EDBT 2009»
15 years 8 months ago
Unrestricted wavelet synopses under maximum error bound
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
GLOBECOM
2009
IEEE
15 years 8 months ago
Joint Base Station Placement and Fault-Tolerant Routing in Wireless Sensor Networks
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
Dejun Yang, Satyajayant Misra, Guoliang Xue
AAAI
2006
15 years 6 months ago
Functional Value Iteration for Decision-Theoretic Planning with General Utility Functions
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
Yaxin Liu, Sven Koenig
AML
2010
80views more  AML 2010»
15 years 4 months ago
Goodness in the enumeration and singleton degrees
We investigate and extend the notion of a good approximation with respect to the enumeration (De) and singleton (Ds) degrees. We refine two results by Griffith, on the inversion of...
Charles M. Harris