1988 search results - page 133 / 398 » Engineering formal metatheory |
158
click to vote
SIAMCOMP
2011
14 years 27 days ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
122
click to vote
SIAMCOMP
2011
14 years 27 days ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
CHARME
2001
Springer
15 years 2 months ago
2001
Springer
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
109
click to vote
SEDE
2010
14 years 8 months ago
2010
New emerging scientific applications in geosciences, sensor and spatio-temporal domains require adaptive analysis frameworks that can handle large datasets with multiple dimension...
SIGSOFT
2010
ACM
14 years 8 months ago
2010
ACM
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...