2996 search results - page 263 / 600 » Numberings and Randomness |
159
click to vote
WEA
2004
Springer
16 years 14 hour ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
154
click to vote
DKE
2008
15 years 6 months ago
2008
In many database applications, there are opportunities for multiple top-N queries to be evaluated at the same time. Often it is more cost effective to evaluate multiple such queri...
194
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
— In this paper we demonstrate how TCP congestion control can show chaotic behavior. We demonstrate the major features of chaotic systems in TCP/IP networks with examples. These ...
173
click to vote
ECOOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
185
click to vote
IJCAI
1989
15 years 7 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...