Sciweavers

17760 search results - page 3534 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
CORR
2000
Springer
120views Education» more  CORR 2000»
13 years 7 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
COMPUTER
2002
79views more  COMPUTER 2002»
13 years 7 months ago
A Practical Architecture for Reliable Quantum Computers
wever, by using a simple model of abstract building blocks: quantum bits, gates, and algorithms, and the available implementation technologies--in all their imperfections.7 The bas...
Mark Oskin, Frederic T. Chong, Isaac L. Chuang
CONCURRENCY
2002
99views more  CONCURRENCY 2002»
13 years 7 months ago
A distributed computing environment for interdisciplinary applications
Practical applications are generally interdisciplinary in nature. The technology is well matured for addressing individual discipline applications and not for interdisciplinary ap...
Jerry A. Clarke, Raju R. Namburu
MOC
2000
70views more  MOC 2000»
13 years 7 months ago
Extrapolation methods and derivatives of limits of sequences
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
Avram Sidi
MST
2000
57views more  MST 2000»
13 years 7 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
« Prev « First page 3534 / 3552 Last » Next »