Sciweavers

684 search results - page 67 / 137
» A characterization of b-perfect graphs
Sort
View
CP
2006
Springer
15 years 3 months ago
Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
Michele Lombardi, Michela Milano
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 29 days ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur
IPPS
2007
IEEE
15 years 6 months ago
Incorporating Latency in Heterogeneous Graph Partitioning
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...
Eric E. Aubanel, Xiaochen Wu
ICALP
2000
Springer
15 years 3 months ago
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
Jesper G. Henriksen, Madhavan Mukund, K. Narayan K...
IPCO
2007
77views Optimization» more  IPCO 2007»
15 years 1 months ago
Mixed-Integer Vertex Covers on Bipartite Graphs
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
Michele Conforti, Bert Gerards, Giacomo Zambelli