4103 search results - page 162 / 821 » Some results on the Collatz problem |
147
click to vote
CPM
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
161
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
143
click to vote
MFCS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
157
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
How to estimate the shortest routing length when certain blocks are considered as routing obstacles is becoming an essential problem for block placement because HPWL is no longer v...
160
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...