Sciweavers

3342 search results - page 482 / 669
» Automating Abstract Interpretation
Sort
View
71
Voted
LICS
2006
IEEE
15 years 6 months ago
A Characterisation of First-Order Constraint Satisfaction Problems
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
Benoit Larose, Cynthia Loten, Claude Tardif
126
Voted
LICS
2006
IEEE
15 years 6 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
ADG
2006
Springer
177views Mathematics» more  ADG 2006»
15 years 6 months ago
Recognition of Computationally Constructed Loci
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
Peter Lebmeir, Jürgen Richter-Gebert
ADMA
2006
Springer
172views Data Mining» more  ADMA 2006»
15 years 6 months ago
Experimental Comparison of Feature Subset Selection Using GA and ACO Algorithm
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...
Keunjoon Lee, Jinu Joo, Jihoon Yang, Vasant Honava...
LICS
2005
IEEE
15 years 6 months ago
Process Algebras for Quantitative Analysis
In the 1980s process algebras became widely accepted formalisms for describing and analysing concurrency. Extensions of the formalisms, incorporating some aspects of systems which...
Jane Hillston