Sciweavers

1963 search results - page 88 / 393
» The Maximum Solution Problem on Graphs
Sort
View
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
14 years 4 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
TRANSCI
2010
98views more  TRANSCI 2010»
13 years 4 months ago
The Vehicle Routing Problem with Stochastic Demand and Duration Constraints
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duratio...
Alan L. Erera, Juan C. Morales, Martin W. P. Savel...
AAAI
2008
14 years 8 days ago
Multiagent Graph Coloring: Pareto Efficiency, Fairness and Individual Rationality
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
Yaad Blum, Jeffrey S. Rosenschein
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
14 years 3 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
GG
2004
Springer
14 years 3 months ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...