Sciweavers

28888 search results - page 5382 / 5778
» Computability and complexity in analysis
Sort
View
203
Voted
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
DAC
1994
ACM
15 years 11 months ago
A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
Gjalt G. de Jong, Bill Lin
OOIS
1994
Springer
15 years 11 months ago
Problems, Descriptions and Objects
The business of software development is solving problems. Following Polya, we can increase our ability to solve problems by focusing directly on problems themselves, on their part...
Michael Jackson
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
15 years 11 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
INFOCOM
1992
IEEE
15 years 11 months ago
Design of Virtual Channel Queue in an ATM Broadband Terminal Adaptor
In order to take advantage of the low entry cost of the future public ATM (asynchronous transfer mode) network with shared facilities, it is highly desirable to interconnect diffe...
H. Jonathan Chao, Donald E. Smith
« Prev « First page 5382 / 5778 Last » Next »