4328 search results - page 500 / 866 » A New Kind of Science |
154
Voted
WG
2000
Springer
15 years 10 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
182
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
202
click to vote
RTA
1995
Springer
15 years 10 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
153
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Context, the pieces of information that capture the characteristics of ubiquitous computing environment, is often imprecise and incomplete due to user mobility, unreliable wirel...
171
click to vote
CSR
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...