Sciweavers

9842 search results - page 223 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ESA
2008
Springer
127views Algorithms» more  ESA 2008»
14 years 16 days ago
The Alcuin Number of a Graph
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
Péter Csorba, Cor A. J. Hurkens, Gerhard J....
ACTA
1998
111views more  ACTA 1998»
13 years 10 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt
CLIMA
2008
14 years 6 days ago
Easy Yet Hard: Model Checking Strategies of Agents
Abstract. I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different...
Wojciech Jamroga
EUSFLAT
2001
14 years 4 days ago
Reduction to independent variables: from normal distribution to general statistical case to fuzzy
In many practical problems, we must combine ("fuse") data represented in different formats, e.g., statistical, fuzzy, etc. The simpler the data, the easier to combine th...
Mourad Oussalah, Hung T. Nguyen, Vladik Kreinovich
ALGORITHMICA
2008
121views more  ALGORITHMICA 2008»
13 years 11 months ago
Space Efficient Algorithms for Ordered Tree Comparison
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
Lusheng Wang, Kaizhong Zhang