1763 search results - page 64 / 353 » A Formalization of Polytime Functions |
185
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
FM
2003
Springer
15 years 3 months ago
2003
Springer
Incomplete, inaccurate, ambiguous, and volatile requirements have plagued the software industry since its inception. The convergence of model-based development and formal methods o...
AMC
2006
14 years 9 months ago
2006
We first show that the Halting Function (the noncomputable function that solves the Halting Problem) has explicit expressions in the language of calculus. Out of that fact we elab...
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
145
click to vote
DOCENG
2011
ACM
13 years 9 months ago
2011
ACM
A use case involving integrating results from search engines illustrates how the meta-metadata language facilitates interoperable metadata semantics. Formal semantics can be hard ...