Sciweavers

709 search results - page 122 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
ATAL
2009
Springer
15 years 4 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
CSFW
2007
IEEE
15 years 4 months ago
Creating Vulnerability Signatures Using Weakest Preconditions
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
David Brumley, Hao Wang, Somesh Jha, Dawn Xiaodong...
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
15 years 3 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
MFCS
2007
Springer
15 years 3 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda
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