Sciweavers

9842 search results - page 175 / 1969
» Problem complexity
Sort
View
MST
2007
138views more  MST 2007»
15 years 1 months ago
Parameterized Complexity of Vertex Cover Variants
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
117
Voted
SAC
2008
ACM
15 years 1 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
COMPGEOM
2003
ACM
15 years 7 months ago
the asteroid surveying problem and other puzzles
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
FOCS
2009
IEEE
15 years 9 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
IJIT
2004
15 years 3 months ago
A Constructive Problem Solver Approach for Building Agriculture Disorder Treatment Task
Expert systems development is a complex and expensive process that needs to be applied in an organized manner. This paper presents an approach for building a generic treatment mode...
Abeer El-Korany, Ahmed A. Rafea