Sciweavers

1802 search results - page 334 / 361
» Model-based Theory Combination
Sort
View
SAC
2004
ACM
14 years 2 months ago
An architecture for information retrieval over semi-collaborating Peer-to-Peer networks
Peer-to-Peer (P2P) networking is aimed at exploiting the potential of widely distributed information pools and its effortless access and retrieval irrespectively of underlying net...
Iraklis A. Klampanos, Joemon M. Jose
SENSYS
2004
ACM
14 years 2 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...
SIGCSE
2004
ACM
141views Education» more  SIGCSE 2004»
14 years 2 months ago
Running on the bare metal with GeekOS
Undergraduate operating systems courses are generally taught e of two approaches: abstract or concrete. In the approach, students learn the concepts underlying operating systems t...
David Hovemeyer, Jeffrey K. Hollingsworth, Bobby B...
SPAA
2004
ACM
14 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
BIRTHDAY
2004
Springer
14 years 2 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer