7773 search results - page 177 / 1555 » On generalized Frame-Stewart numbers |
164
click to vote
TSMC
2002
15 years 5 months ago
2002
Page-based Linear Genetic Programming (GP) is proposed in which individuals are described in terms of a number of pages. Pages are expressed in terms of a fixed number of instructi...
127
Voted
DM
2006
15 years 6 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
171
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
163
Voted
ENDM
2007
15 years 6 months ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
133
Voted
ATAL
2007
Springer
16 years 10 days ago
2007
Springer
Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alter...