Sciweavers

11397 search results - page 199 / 2280
» A Relational Abstraction for Functions
Sort
View
PERCOM
2006
ACM
16 years 6 months ago
Specification of a Functional Architecture for E-Learning Supported by Wireless Technologies
This paper proposes a distributed platform designed to support pervasive learning and interactivity on a university campus and to ease tasks related to learning and teaching. The ...
Philip Grew, Francesco Giudici, Elena Pagani
COMBINATORICS
2002
60views more  COMBINATORICS 2002»
15 years 7 months ago
Parking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...
Catalin Zara
CIC
2004
110views Communications» more  CIC 2004»
15 years 8 months ago
Towards a Comprehensive Peer-to-Peer Communication Model
Peer-to-Peer computing is a model consisting of cooperating distributed processing units terms peers. Characteristics of this computing model include lack of centralized control an...
Jesus Pajaro, Brian J. d'Auriol
POPL
2007
ACM
16 years 7 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
GLVLSI
2003
IEEE
134views VLSI» more  GLVLSI 2003»
16 years 13 days ago
Modeling QCA for area minimization in logic synthesis
Concerned by the wall that Moore’s Law is expected to hit in the next decade, the integrated circuit community is turning to emerging nanotechnologies for continued device impro...
Nadine Gergel, Shana Craft, John Lach