Sciweavers

925 search results - page 99 / 185
» Connectivity on Complete Lattices
Sort
View
EUC
2007
Springer
16 years 6 days ago
On Using Probabilistic Forwarding to Improve HEC-Based Data Forwarding in Opportunistic Networks
In this paper, we propose the HEC-PF scheme, an enhancement of our previous H-EC scheme for effective data forwarding in opportunistic networks. The enhanced scheme modifies the a...
Ling-Jyh Chen, Cheng-Long Tseng, Cheng-Fu Chou
FPL
2007
Springer
125views Hardware» more  FPL 2007»
16 years 6 days ago
Run-time Partial Reconfiguration for Removal, Placement and Routing on the Virtex-II-Pro
Reconfigurable computing entails the utilization of a generalpurpose processor augmented with a reconfigurable hardware structure (usually an FPGA). Normally, a complete recon...
Stefan Raaijmakers, Stephan Wong
TABLEAUX
2007
Springer
16 years 4 days ago
A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with...
Linda Buisman, Rajeev Goré
IPPS
2006
IEEE
16 years 2 days ago
Using incentives to increase availability in a DHT
Distributed Hash Tables (DHTs) provide a means to build a completely decentralized, large-scale persistent storage service from the individual storage capacities contributed by ea...
Fabio Picconi, Pierre Sens
IWPEC
2004
Springer
15 years 11 months ago
Chordless Paths Through Three Vertices
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
Robert Haas, Michael Hoffmann