2084 search results - page 411 / 417 » Set Constraints in Logic Programming |
135
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
138
Voted
CASES
2009
ACM
15 years 10 months ago
2009
ACM
Embedded processors have become increasingly complex, resulting in variable execution behavior and reduced timing predictability. On such processors, safe timing specifications e...
114
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Data conflation is a major issue in GIS: spatial data obtained from different sources, using different acquisition techniques, needs to be combined into one single consistent d...
146
Voted
FPGA
2007
ACM
15 years 10 months ago
2007
ACM
Shrinking time-to-market and high demand for productivity has driven traditional hardware designers to use design methodologies that start from high-level languages. However, meet...
147
Voted
SAT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...