687 search results - page 47 / 138 » On The Complexity of Manipulating Elections |
SLP
1994
13 years 9 months ago
1994
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, a new tool dedicated to the analysis and the conception of molecules is presented. It is composed of an adaptive simulation software and a haptic device used to ...
JAIR
2010
13 years 6 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
ICTAC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a synchronous approach to real-time reactive programming in Lucid enriched with contexts as first class objects. The declarative intensional approach allows r...