29908 search results - page 5841 / 5982 » On the Complexity of |
COMPUTER
1999
13 years 7 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...
CORR
1999
Springer
13 years 7 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...
JAIR
1998
13 years 7 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 ...
JMLR
2002
13 years 7 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...
JCC
1998
13 years 7 months ago
1998
: A novel procedure for docking ligands in a flexible binding site is presented. It relies on conjugate gradient minimization, during which nonbonded interactions are gradually swi...