Sciweavers

2479 search results - page 346 / 496
» A Computational Theory of Working Memory
Sort
View
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 11 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
CF
2009
ACM
15 years 11 months ago
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
EUSFLAT
2009
146views Fuzzy Logic» more  EUSFLAT 2009»
15 years 4 months ago
Opposite Fuzzy Sets with Applications in Image Processing
Diverse forms of the concept of opposition are already existent in philosophy, linguistics, psychology and physics. The interplay between entities and opposite entities is apparent...
Hamid R. Tizhoosh
MOBICOM
2012
ACM
13 years 9 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...