Sciweavers

1507 search results - page 50 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
ICDCS
2007
IEEE
14 years 4 months ago
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
Guoqiang Shu, David Lee
ESANN
2007
13 years 11 months ago
Three-dimensional self-organizing dynamical systems for discrete structures memorizing and retrieval
The synthesis concept for dynamical system with the memory of multiple states defined with the quaternion algebra usage is considered. The system memorizes numerous configurations ...
Alexander Yudashkin
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
14 years 3 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
ECLIPSE
2004
ACM
14 years 3 months ago
Supporting Java traits in Eclipse
Traits are a language technology that complements inheritance as a means for code reuse and class structuring. Traits encapsulate collections of methods so that they can be used a...
Philip J. Quitslund, Emerson R. Murphy-Hill, Andre...
DAM
1999
128views more  DAM 1999»
13 years 9 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano