Sciweavers

3250 search results - page 263 / 650
» An Algorithm to Solve a Linear Program
Sort
View
IJCAI
2001
15 years 8 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
GLOBECOM
2007
IEEE
16 years 28 days ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
TON
2012
13 years 9 months ago
Static Routing and Wavelength Assignment for Multicast Advance Reservation in All-Optical Wavelength-Routed WDM Networks
—In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Under the advanced reservation traffic model...
Neal Charbonneau, Vinod Vokkarane
FOCS
2005
IEEE
16 years 6 days ago
Approximation Algorithms for Unique Games
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
Luca Trevisan
STOC
1998
ACM
167views Algorithms» more  STOC 1998»
15 years 10 months ago
An Improved Approximation Algorithm for Multiway Cut
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani