Sciweavers

1736 search results - page 299 / 348
» The rank-width of Directed Graphs
Sort
View
ECAI
2000
Springer
15 years 4 months ago
Learning Efficiently with Neural Networks: A Theoretical Comparison between Structured and Flat Representations
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
Marco Gori, Paolo Frasconi, Alessandro Sperduti
106
Voted
ER
2000
Springer
122views Database» more  ER 2000»
15 years 4 months ago
Managing RDF Metadata for Community Webs
The need for descriptive information, i.e., metadata, about Web resources has been recognized in several application contexts (e.g., digital libraries, portals). The Resource Descr...
Sofia Alexaki, Vassilis Christophides, Gregory Kar...
ICTAI
2000
IEEE
15 years 4 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
130
Voted
ECOOP
1995
Springer
15 years 4 months ago
Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis
Optimizing compilers for object-oriented languages apply static class analysis and other techniques to try to deduce precise information about the possible classes of the receivers...
Jeffrey Dean, David Grove, Craig Chambers
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
15 years 4 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling