3897 search results - page 74 / 780 » complexity 2010 |
IWPC
2010
IEEE
15 years 26 days ago
2010
IEEE
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
112
click to vote
LPAR
2010
Springer
15 years 25 days ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
150
Voted
ORDER
2010
15 years 25 days ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
123
click to vote
WG
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
101
click to vote
WIOPT
2010
IEEE
15 years 23 days ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...