8689 search results - page 173 / 1738 » Software: hard data |
159
click to vote
SCAM
2003
IEEE
15 years 11 months ago
2003
IEEE
One of the critiques on program slicing is that slices presented to the user are hard to understand. This is partly due to bad user interfaces, but mainly related to the problem t...
153
click to vote
CISSE
2009
Springer
15 years 10 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
151
click to vote
IESA
2007
15 years 7 months ago
2007
The application of model-driven development facilitates faster and more flexible integration by separating system descriptions to different levels of abstraction. In crossorganisat...
144
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
157
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...