Sciweavers

432 search results - page 59 / 87
» Out of context: Computer systems that adapt to, and learn fr...
Sort
View
EUROCOLT
1999
Springer
14 years 1 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
SEKE
1993
Springer
14 years 27 days ago
Recovering Conceptual Data Models is Human-Intensive
1 To handle the complexity of modern software systems, a software comprehension strategy pointing out the al abstraction level is necessary. In this context, the role of technology...
Fabio Abbattista, Filippo Lanubile, Giuseppe Visag...
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
14 years 2 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
WWW
2004
ACM
14 years 9 months ago
Dynamic assembly of learning objects
This paper describes one solution to the problem of how to select sequence, and link Web resources into a coherent, focused organization for instruction that addresses a user'...
Robert G. Farrell, Soyini D. Liburd, John C. Thoma...
CEC
2003
IEEE
14 years 2 months ago
A note on general adaptation in populations of painting robots
A population of virtual robots is evolved to perform the task of competitively painting the floor of a toroidal room. Two robots are present in any given room and paint using dis...
Dan Ashlock, Elizabeth Blankenship, Jonathan Gandr...