Sciweavers

364 search results - page 51 / 73
» Generalized normal forms and polynomial system solving
Sort
View
CP
2008
Springer
14 years 11 months ago
Exploiting Common Subexpressions in Numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
Ignacio Araya, Bertrand Neveu, Gilles Trombettoni
IJAC
2011
14 years 1 months ago
The Subword Reversing Method
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
Patrick Dehornoy
84
Voted
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 2 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
CORR
2008
Springer
131views Education» more  CORR 2008»
14 years 9 months ago
Jamming in Fixed-Rate Wireless Systems with Power Constraints - Part I: Fast Fading Channels
This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading, under the general assumption that the jammer has no...
George T. Amariucai, Shuangqing Wei
RELMICS
2005
Springer
15 years 3 months ago
Relational Correspondences for Lattices with Operators
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
Jouni Järvinen, Ewa Orlowska