Sciweavers

178 search results - page 32 / 36
» combinatorics 2007
Sort
View
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 26 days ago
Genetic multi-step search in interpolation and extrapolation domain
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...
Yoshiko Hanada, Tomoyuki Hiroyasu, Mitsunori Miki
COCOON
2007
Springer
16 years 27 days ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav
176
Voted
MOBIHOC
2007
ACM
16 years 6 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
180
Voted
CGO
2007
IEEE
16 years 1 months ago
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
Emerging microprocessors offer unprecedented parallel computing capabilities and deeper memory hierarchies, increasing the importance of loop transformations in optimizing compile...
Louis-Noël Pouchet, Cédric Bastoul, Al...
152
Voted
COCOON
2007
Springer
16 years 27 days ago
Colored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabr...