Sciweavers

3211 search results - page 284 / 643
» On the Grundy Number of a Graph
Sort
View
LION
2009
Springer
203views Optimization» more  LION 2009»
16 years 1 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
FMCAD
2007
Springer
16 years 24 days ago
Analyzing Gene Relationships for Down Syndrome with Labeled Transition Graphs
Abstract— The relationship between changes in gene expression and physical characteristics associated with Down syndrome is not well understood. Chromosome 21 genes interact with...
Neha Rungta, Hyrum Carroll, Eric G. Mercer, Randal...
ASPDAC
2006
ACM
91views Hardware» more  ASPDAC 2006»
16 years 19 days ago
Fast substrate noise-aware floorplanning with preference directed graph for mixed-signal SOCs
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
Minsik Cho, Hongjoong Shin, David Z. Pan
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 18 days ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
WEBI
2005
Springer
16 years 3 days ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...