Sciweavers

3267 search results - page 635 / 654
» Generalized quasirandom graphs
Sort
View
ZUM
1997
Springer
125views Formal Methods» more  ZUM 1997»
14 years 17 days ago
A Formal OO Method Inspired by Fusion and Object-Z
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
Klaus Achatz, Wolfram Schulte
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 16 days 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 ...
AII
1992
14 years 16 days ago
Learning from Multiple Sources of Inaccurate Data
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
Ganesh Baliga, Sanjay Jain, Arun Sharma
FP
1992
135views Formal Methods» more  FP 1992»
14 years 16 days ago
High Level Specification of I/O in Functional Languages
The interface with the outside world has always been one of the weakest points of functional languages. It is not easy to incorporate I/O without being allowed to do side-effects....
Peter Achten, John H. G. van Groningen, Marinus J....
CIKM
2007
Springer
14 years 13 days ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang