Sciweavers

2206 search results - page 147 / 442
» On the power of coercion abstraction
Sort
View
CIE
2009
Springer
15 years 8 months ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich
DALT
2009
Springer
15 years 8 months ago
Playing with Rules
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
João Leite
ICMT
2009
Springer
15 years 8 months ago
A Collection Operator for Graph Transformation
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
Roy Grønmo, Stein Krogdahl, Birger Mø...
ICC
2007
IEEE
122views Communications» more  ICC 2007»
15 years 8 months ago
Code-Aided ML Ambiguity Resolution
Abstract— This paper deals with code-aided (CA) maximumlikelihood (ML) phase and timing ambiguity resolution. We propose a methodology based on the sum-product algorithm (SPA) to...
Cédric Herzet, Luc Vandendorpe
ICRA
2007
IEEE
111views Robotics» more  ICRA 2007»
15 years 8 months ago
Using COTS to Construct a High Performance Robot Arm
Abstract— In this paper we present a design study and technical specifications of a high performance robotic manipulator to be used for ball catching experiments using commercia...
Christian Smith, Henrik I. Christensen