Sciweavers

5158 search results - page 727 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
15 years 10 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
DAC
2010
ACM
15 years 10 months ago
Lattice-based computation of Boolean functions
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
Mustafa Altun, Marc D. Riedel
EENERGY
2010
15 years 10 months ago
Optimal sleep patterns for serving delay-tolerant jobs
Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where en...
Ioannis Kamitsos, Lachlan L. H. Andrew, Hongseok K...
CANDT
2009
15 years 10 months ago
Understanding collective content: purposes, characteristics and collaborative practices
User-created media content is being increasingly shared with the communities people belong to. The content has a role of a motivator in social interaction within the communities. ...
Thomas Olsson
ICDCS
2010
IEEE
15 years 10 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...