6142 search results - page 265 / 1229 » The Complexity of Partition Functions |
150
click to vote
DISOPT
2010
15 years 6 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
150
click to vote
EOR
2006
15 years 6 months ago
2006
In this paper we develop an open queueing network for optimal design of multi-stage assemblies, in which each service station represents a manufacturing or assembly operation. The...
154
click to vote
JCC
2006
15 years 6 months ago
2006
: Electronic mechanism of the reversible O2 binding by heme was studied by using Density Functional Theory calculations. The ground state of oxyheme was calculated to be open singl...
145
Voted
NETWORKS
2010
15 years 4 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
153
Voted
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...