Sciweavers

193 search results - page 29 / 39
» Members of Random Closed Sets
Sort
View
COCO
2009
Springer
98views Algorithms» more  COCO 2009»
14 years 5 months ago
Extractors for Varieties
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
Zeev Dvir
ECOOP
2008
Springer
14 years 19 days ago
Online Phase-Adaptive Data Layout Selection
Good data layouts improve cache and TLB performance of object-oriented software, but unfortunately, selecting an optimal data layout a priori is NP-hard. This paper introduces layo...
Chengliang Zhang, Martin Hirzel
ECAI
2010
Springer
13 years 12 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
CN
2008
100views more  CN 2008»
13 years 11 months ago
Stability-throughput tradeoff and routing in multi-hop wireless ad hoc networks
We study the throughput of multi-hop routes and stability of forwarding queues in a wireless ad-hoc network with random access channel. We focus on a wireless network with static ...
Arzad Alam Kherani, Ralph El Khoury, Rachid El Azo...
IPL
2008
89views more  IPL 2008»
13 years 10 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik