8824 search results - page 356 / 1765 » On the Complexity of Real Functions |
167
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
166
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...
167
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...
165
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...
169
click to vote
NETWORKS
2010
15 years 5 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...