1688 search results - page 31 / 338 » The Complexity of Rationalizing Matchings |
ESANN
2007
13 years 9 months ago
2007
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
In a dynamic service oriented environment it is desirable for service consumers and providers to offer and obtain guarantees regarding their capabilities and requirements. WS-Agre...
AAMAS
2011
Springer
13 years 2 months ago
2011
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...