Sciweavers

1144 search results - page 130 / 229
» Logic programming for combinatorial problems
Sort
View
239
Voted
PLDI
2009
ACM
16 years 3 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
ICALP
2007
Springer
15 years 8 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
VISSOFT
2005
IEEE
15 years 8 months ago
Multi-level Method Understanding Using Microprints
Understanding classes and methods is a key activity in object-oriented programming, since classes represent the abstractions from which applications are built, while methods conta...
Stéphane Ducasse, Michele Lanza, Romain Rob...
ECAI
2004
Springer
15 years 8 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 4 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze