Sciweavers

963 search results - page 137 / 193
» On the decomposition of rational functions
Sort
View
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 8 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
JUCS
2002
119views more  JUCS 2002»
13 years 8 months ago
Error-Correction, and Finite-Delay Decodability
: When the words of a language are communicated via a noisy channel, the language property of error-detection ensures that no word of the language can be transformed to another wor...
Stavros Konstantinidis
IJITM
2010
93views more  IJITM 2010»
13 years 7 months ago
A group evidential reasoning approach for enterprise architecture framework selection
: Enterprise architecture (EA) frameworks are used to ensure interoperability of information systems and improve the effectiveness and efficiency of business organisations. Several...
Faramak Zandi, Madjid Tavana
LPAR
2010
Springer
13 years 7 months ago
A Syntactical Approach to Qualitative Constraint Networks Merging
We address the problem of merging qualitative constraint networks (QCNs) representing agents local preferences or beliefs on the relative position of spatial or temporal entities. ...
Jean-François Condotta, Souhila Kaci, Pierr...
PSD
2010
Springer
154views Database» more  PSD 2010»
13 years 7 months ago
Coprivacy: Towards a Theory of Sustainable Privacy
We introduce the novel concept of coprivacy or co-operative privacy to make privacy preservation attractive. A protocol is coprivate if the best option for a player to preserve her...
Josep Domingo-Ferrer