29908 search results - page 5864 / 5982 » On the complexity of communication complexity |
201
click to vote
INFORMS
1998
15 years 6 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
176
click to vote
COMPUTER
1999
15 years 6 months ago
1999
abstract over a complex set of resources and provide a high-level way to share and manage them over the network. To be effective, such a system must address the challenges posed by...
142
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
166
click to vote
JAIR
1998
15 years 6 months ago
1998
Scheduling dialogs, during which people negotiate the times of appointments, are common in everyday life. This paper reports the results of an in-depth empirical investigation of ...
164
click to vote
JMLR
2002
15 years 6 months ago
2002
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...