Sciweavers

1071 search results - page 18 / 215
» Programming with enumerable sets of structures
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
14 years 1 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 10 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
LPNMR
2007
Springer
14 years 4 months ago
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
Stefan Woltran
INFSOF
2008
85views more  INFSOF 2008»
13 years 9 months ago
Locating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li
VMCAI
2005
Springer
14 years 3 months ago
Generalized Typestate Checking for Data Structure Consistency
Abstract. We present an analysis to verify abstract set specifications for programs that use object field values to determine the membership of objects in abstract sets. In our a...
Patrick Lam, Viktor Kuncak, Martin C. Rinard