Sciweavers

61 search results - page 3 / 13
» On the Complexity of the Balanced Vertex Ordering Problem
Sort
View
PDCN
2004
13 years 9 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
JCO
2007
74views more  JCO 2007»
13 years 7 months ago
Maximum cyclic 4-cycle packings of the complete multipartite graph
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
Shung-Liang Wu, Hung-Lin Fu
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 8 months ago
Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
Uwe Aickelin, Kathryn A. Dowsland
CAGD
2006
114views more  CAGD 2006»
13 years 8 months ago
Jet subdivision schemes on the k-regular complex
We introduce a new family of subdivision schemes called jet subdivision schemes. Jet subdivision schemes are a natural generalization of the commonly used subdivision schemes for ...
Yonggang Xue, Thomas P.-Y. Yu, Tom Duchamp
ASPDAC
2007
ACM
108views Hardware» more  ASPDAC 2007»
13 years 12 months ago
Reduced-Order Wide-Band Interconnect Model Realization using Filter-Based Spline Interpolation
In the paper, we develop a systematic methodology for modeling sampled interconnect frequency response data based on spline interpolation. Through piecewise polynomial interpolatio...
Arthur Nieuwoudt, Mehboob Alam, Yehia Massoud