14936 search results - page 2955 / 2988 » Can They Take It With Them |
LATIN
2010
Springer
13 years 5 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—Polarized logic is the logic of values and continuations, and their interaction through continuation-passing style. The main limitations of this logic are the limitation...
MST
2010
13 years 5 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
OIR
2010
13 years 5 months ago
2010
Purpose – The purpose of this paper is to examine the integration of digital library (DL) technologies with ontology-based knowledge representation in providing semantic rich in...
OOPSLA
2010
Springer
13 years 5 months ago
2010
Springer
Models are important artifacts in the software development life-cycle and are often the result of a collaborative activity of multiple developers. When multiple developers modify ...