Sciweavers

698 search results - page 10 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
TAMC
2007
Springer
15 years 3 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
15 years 1 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
ATAL
2009
Springer
15 years 4 months ago
Solving multiagent assignment Markov decision processes
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
Scott Proper, Prasad Tadepalli
95
Voted
BROADNETS
2006
IEEE
15 years 1 months ago
Wavelength Assignment in Optical Networks with Imprecise Network State Information
Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research ha...
Satyajeet Ahuja, Marwan Krunz, Srinivasan Ramasubr...
COMPGEOM
1998
ACM
15 years 1 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan