5634 search results - page 114 / 1127 » About Abstract Classes |
COMPSAC
2005
IEEE
15 years 4 months ago
2005
IEEE
Maintenance is a time consuming activity within software development and it requires a good understanding of the system in question. It is hard or even impossible to understand po...
CAV
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
CINQ
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
CP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
103
click to vote
CP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...