2191 search results - page 113 / 439 » Improving the Efficiency of Non-Deterministic Computations |
171
click to vote
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
143
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...
187
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
168
click to vote
IJLT
2010
15 years 4 months ago
2010
: Ubiquitous computing could help the organisation and the mediation of social interactions wherever and whenever these situations might occur. Using those technologies enables the...
186
click to vote
CCGRID
2006
IEEE
16 years 1 days ago
2006
IEEE
—A Web services-based publish/subscribe system has the potential to create an Internet scale interoperable event notification system which is important for Grid computing as it e...