1763 search results - page 64 / 353 » A Formalization of Polytime Functions |
253
click to vote
CP
2009
Springer
16 years 4 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...
140
Voted
FM
2003
Springer
15 years 9 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...
107
click to vote
AMC
2006
15 years 3 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...
134
Voted
ICALP
2011
Springer
14 years 7 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...
217
Voted
DOCENG
2011
ACM
14 years 3 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 ...