3146 search results - page 327 / 630 » Efficient Consequence Finding |
116
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
102
click to vote
ESWS
2008
Springer
15 years 6 months ago
2008
Springer
Finding RDF individuals that refer to the same real-world entities but have different URIs is necessary for the efficient use of data across sources. The requirements for such inst...
151
click to vote
EUROPAR
2008
Springer
15 years 6 months ago
2008
Springer
Cache affinity between a process and a processor is observed when the processor cache has accumulated some amount of the process state, i.e., data or instructions. Cache affinity i...
118
click to vote
EUROPAR
2008
Springer
15 years 6 months ago
2008
Springer
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
130
click to vote
FMCAD
2008
Springer
15 years 6 months ago
2008
Springer
Automatic techniques for software verification focus on obtaining witnesses of program failure. Such counterexamples often fail to localize the precise cause of an error and usuall...