Sciweavers

11740 search results - page 2301 / 2348
» More Problems in Rewriting
Sort
View
NN
2000
Springer
152views Neural Networks» more  NN 2000»
13 years 8 months ago
A neural network theory of proportional analogy-making
A neural network model that can simulate the learning of some simple proportional analogies is presented. These analogies include, for example, (a) red-square:red-circle yellow-sq...
Nilendu G. Jani, Daniel S. Levine
IDA
2002
Springer
13 years 8 months ago
Classification and filtering of spectra: A case study in mineralogy
The ability to identify the mineral composition of rocks and soils is an important tool for the exploration of geological sites. Even though expert knowledge is commonly used for t...
Jonathan Moody, Ricardo Bezerra de Andrade e Silva...
SCP
2000
119views more  SCP 2000»
13 years 8 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
SIAMCOMP
2000
161views more  SIAMCOMP 2000»
13 years 8 months ago
Application-Controlled Paging for a Shared Cache
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...
CC
1998
Springer
111views System Software» more  CC 1998»
13 years 8 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson
« Prev « First page 2301 / 2348 Last » Next »