Sciweavers

7839 search results - page 1516 / 1568
» What's News, What's Not
Sort
View
EC
1998
112views ECommerce» more  EC 1998»
13 years 8 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
IR
2002
13 years 8 months ago
An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms
Collaborative filtering systems predict a user's interest in new items based on the recommendations of other people with similar interests. Instead of performing content index...
Jonathan L. Herlocker, Joseph A. Konstan, John Rie...
EXPERT
1998
86views more  EXPERT 1998»
13 years 8 months ago
IMACS: A Case Study in Real-World Planning
This article illustrates the complexities of real-world planning and how we can create AI planning systems to address them. We describe the IMACS Project (Interactive Manufacturab...
Satyandra K. Gupta, Dana S. Nau, William C. Regli
IJON
1998
140views more  IJON 1998»
13 years 8 months ago
Comment on "Discrete-time recurrent neural network architectures: A unifying review"
Paper [1] aimed at providing a unified presentation of neural network architectures. We show in the present comment (i) that the canonical form of recurrent neural networks presen...
Léon Personnaz, Gérard Dreyfus
JSYML
1998
61views more  JSYML 1998»
13 years 8 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah
« Prev « First page 1516 / 1568 Last » Next »