28888 search results - page 5408 / 5778 » Computability and complexity in analysis |
169
click to vote
INFORMS
1998
15 years 4 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 ...
122
click to vote
CORR
1999
Springer
15 years 4 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...
143
click to vote
TCS
1998
15 years 4 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
152
click to vote
TKDE
1998
15 years 4 months ago
1998
—There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency an...
170
Voted
TVCG
1998
15 years 4 months ago
1998
—Recursive subdivision schemes have been extensively used in computer graphics, computer-aided geometric design, and scientific visualization for modeling smooth surfaces of arbi...