Sciweavers

925 search results - page 138 / 185
» Connectivity on Complete Lattices
Sort
View
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
13 years 11 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
CSE
2009
IEEE
13 years 10 months ago
Extended Dempster-Shafer Theory in Context Reasoning for Ubiquitous Computing Environments
—Context, the pieces of information that capture the characteristics of ubiquitous computing environment, is often imprecise and incomplete due to user mobility, unreliable wirel...
Daqiang Zhang, Jiannong Cao, Jingyu Zhou, Minyi Gu...
AAAI
2007
13 years 9 months ago
Learning Large Scale Common Sense Models of Everyday Life
Recent work has shown promise in using large, publicly available, hand-contributed commonsense databases as joint models that can be used to infer human state from day-to-day sens...
William Pentney, Matthai Philipose, Jeff A. Bilmes...
DLOG
2007
13 years 9 months ago
Integrated Distributed Description Logics
In the context of the Semantic Web or semantic peer to peer systems, many ontologies may exist and be developed independently. Ontology alignments help integrating, mediating or re...
Antoine Zimmermann
AUTONOMICS
2007
ACM
13 years 9 months ago
Multi-hop broadcast from theory to reality: practical design for ad hoc networks
We propose a complete design for a scope limited, multihop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networ...
Alaeddine El Fawal, Jean-Yves Le Boudec, Kav&eacut...