5451 search results - page 209 / 1091 » On very high degrees |
186
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
177
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
145
click to vote
NIPS
2007
15 years 8 months ago
2007
Extensive games are a powerful model of multiagent decision-making scenarios with incomplete information. Finding a Nash equilibrium for very large instances of these games has re...
187
click to vote
APVIS
2003
15 years 8 months ago
2003
UML class diagrams of complex software systems are frequently very large, making it difficult to gain a detailed understanding of the underlying software components within the con...
176
click to vote
BMVC
1998
15 years 8 months ago
1998
A technique for recognizing planar objects in three-dimensional space is described. The object's domain is not restricted to purely two-dimensional items but includes fairly ...