Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Tatsumi, Hisayuki"'
Publikováno v:
ISMVL 2021, May 2021, Nursultan, Kazakhstan
We continue the investigation of systems of hereditarily rigid relations started in Couceiro, Haddad, Pouzet and Sch\"olzel [1]. We observe that on a set $V$ with $m$ elements, there is a hereditarily rigid set $\mathcal R$ made of $n$ tournaments if
Externí odkaz:
http://arxiv.org/abs/2104.00292
Autor:
Delhommé, Christian, Miyakawa, Masahiro, Pouzet, Maurice, Rosenberg, Ivo G., Tatsumi, Hisayuki
A system $\mathcal M$ of equivalence relations on a set $E$ is \emph{semirigid} if only the identity and constant functions preserve all members of $\mathcal M$. We construct semirigid systems of three equivalence relations. Our construction leads to
Externí odkaz:
http://arxiv.org/abs/1505.02955
Autor:
Delhomm��, Christian, Miyakawa, Masahiro, Pouzet, Maurice, Rosenberg, Ivo G., Tatsumi, Hisayuki
Publikováno v:
Journal of Multiple-Valued Logic and Soft Computing
Journal of Multiple-Valued Logic and Soft Computing, Old City Publishing, 2017, 28 (4-5), pp.511-535
Journal of Multiple-Valued Logic and Soft Computing, Old City Publishing, 2017, 28 (4-5), pp.511-535
A system $\mathcal M$ of equivalence relations on a set $E$ is \emph{semirigid} if only the identity and constant functions preserve all members of $\mathcal M$. We construct semirigid systems of three equivalence relations. Our construction leads to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4302e22c20c7dad5bf248dec4a9ba8e
https://hal.univ-reunion.fr/hal-01816479
https://hal.univ-reunion.fr/hal-01816479
Publikováno v:
数理解析研究所講究録. 1846:66-79
Publikováno v:
数理解析研究所講究録. 1846:113-128
Publikováno v:
神奈川工科大学研究報告.B,理工学編. 34:25-33
application/pdf
In this paper, the authors discuss optimization algorithms for engineering layout problems in industry, such as sheet metal design, VLSI floor plan design and so forth. We propose game-theoretic algorithms by constructing polyomi
In this paper, the authors discuss optimization algorithms for engineering layout problems in industry, such as sheet metal design, VLSI floor plan design and so forth. We propose game-theoretic algorithms by constructing polyomi
Publikováno v:
ACM International Conference Proceeding Series; 10/26/2018, p297-301, 5p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
神奈川工科大学研究報告.B,理工学編. 22:95-101
application/pdf
It is well known that traveling salesm皿problem(for short. TSP) is one of most important problems for optimization, and almost all optimization problems result in TSP. This paper describes on an effective solution of TSP using g
It is well known that traveling salesm皿problem(for short. TSP) is one of most important problems for optimization, and almost all optimization problems result in TSP. This paper describes on an effective solution of TSP using g
Publikováno v:
神奈川工科大学研究報告.B,理工学編. 20:125-132
application/pdf
情報学
情報学