16844 search results - page 3098 / 3369 » How to Design Programs |
242
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
171
click to vote
COMPSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
Software reliability is defined as the probability of failure-free software operation for a specified period of time in a specified environment. Over the past 30 years, many softw...
193
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
180
click to vote
ISSTA
2010
ACM
15 years 10 months ago
2010
ACM
Recently, there has been much interest in developing analyzes to detect concurrency bugs that arise because of data races, atomicity violations, execution omission, etc. However, ...
173
click to vote
EDBT
2000
ACM
15 years 10 months ago
2000
ACM
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...