253 search results - page 32 / 51 » Edge and Node Searching Problems on Trees |
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...