Sciweavers

2286 search results - page 204 / 458
» Algorithms for Categorical Equivalence
Sort
View
ICGI
2010
Springer
15 years 7 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 6 months ago
State Elimination Ordering Strategies: Some Experimental Results
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
Nelma Moreira, Davide Nabais, Rogério Reis
IANDC
2008
116views more  IANDC 2008»
15 years 6 months ago
Deciding expressive description logics in the framework of resolution
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
COMPUTING
2006
102views more  COMPUTING 2006»
15 years 6 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
CORR
2007
Springer
51views Education» more  CORR 2007»
15 years 6 months ago
Projection semantics for rigid loops
A rigid loop is a for-loop with a counter not accessible to the loop body or any other part of a program. Special instructions for rigid loops are introduced on top of the syntax ...
Jan A. Bergstra, Alban Ponse