Sciweavers

1963 search results - page 266 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
ICSE
2010
IEEE-ACM
14 years 1 months ago
Exemplar: EXEcutable exaMPLes ARchive
Searching for applications that are highly relevant to development tasks is challenging because the high-level intent reflected in the descriptions of these tasks doesn’t usual...
Mark Grechanik, Chen Fu, Qing Xie, Collin McMillan...
ISCA
2009
IEEE
137views Hardware» more  ISCA 2009»
14 years 3 months ago
A case for an interleaving constrained shared-memory multi-processor
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
Jie Yu, Satish Narayanasamy
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 11 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
PASTE
2005
ACM
14 years 2 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen