Sciweavers

1368 search results - page 15 / 274
» Generalized Rook Polynomials
Sort
View
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
13 years 10 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
SOCO
2002
Springer
13 years 8 months ago
Fuzzy relation equations (I): the general and specialized solving algorithms
In this article, we develop a new method and an algorithm to solve a system of fuzzy relation equations. We first introduce a solution-base-matrix and then give a tractable mathema...
Li Chen, Paul P. Wang
DAM
2006
100views more  DAM 2006»
13 years 8 months ago
On the colored Tutte polynomial of a graph of bounded treewidth
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
Lorenzo Traldi
ACSD
2007
IEEE
88views Hardware» more  ACSD 2007»
14 years 2 months ago
Testing the executability of scenarios in general inhibitor nets
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...
Robert Lorenz, Sebastian Mauser, Robin Bergenthum
EUROCRYPT
1999
Springer
14 years 22 days ago
Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
Thomas Johansson, Fredrik Jönsson