Sciweavers

606 search results - page 114 / 122
» Constraint Hierarchies and Logic Programming
Sort
View
PLDI
2009
ACM
14 years 2 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
WWW
2004
ACM
14 years 8 months ago
Semantic email
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
Luke McDowell, Oren Etzioni, Alon Y. Halevy, Henry...
CF
2009
ACM
14 years 2 months ago
Mapping the LU decomposition on a many-core architecture: challenges and solutions
Recently, multi-core architectures with alternative memory subsystem designs have emerged. Instead of using hardwaremanaged cache hierarchies, they employ software-managed embedde...
Ioannis E. Venetis, Guang R. Gao
ASIAN
1998
Springer
118views Algorithms» more  ASIAN 1998»
13 years 12 months ago
Bisimulation Lattice of Chi Processes
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...
Yuxi Fu
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 10 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...