1963 search results - page 165 / 393 » The Maximum Solution Problem on Graphs |
112
Voted
COMBINATORICS
1999
15 years 2 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
131
Voted
CP
2000
Springer
15 years 6 months ago
2000
Springer
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
147
Voted
TCBB
2008
15 years 2 months ago
2008
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
118
Voted
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
117
click to vote
ESANN
2006
15 years 4 months ago
2006
The Blind Source Separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical dependency between outputs. Since global maximization may be ...