Sciweavers

1929 search results - page 262 / 386
» An Approach to Limit the Wynot Problem
Sort
View
CP
2003
Springer
14 years 2 months ago
Solving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
ICSE
2008
IEEE-ACM
14 years 9 months ago
Scalable detection of semantic clones
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
Mark Gabel, Lingxiao Jiang, Zhendong Su
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
14 years 1 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
RT
1997
Springer
14 years 1 months ago
Interactive Common Illumination for Computer Augmented Reality
: The advent of computer augmented reality (CAR), in which computer generated objects mix with real video images, has resulted in many interesting new application domains. Providin...
George Drettakis, Luc Robert, Sylvain Bougnoux
DSN
2006
IEEE
14 years 18 days ago
Efficiently Detecting All Dangling Pointer Uses in Production Servers
In this paper, we propose a novel technique to detect all dangling pointer uses at run-time that is efficient enough for production use in server codes. One idea (previously used ...
Dinakar Dhurjati, Vikram S. Adve