14054 search results - page 2758 / 2811 » P |
CORR
1999
Springer
14 years 11 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
14 years 11 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 ...
111
click to vote
JISE
1998
14 years 11 months ago
1998
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. We build upon recent results by ...
109
click to vote
ML
2002
ACM
14 years 11 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
MOC
2002
14 years 11 months ago
2002
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...