Sciweavers

4377 search results - page 366 / 876
» Mass problems and randomness
Sort
View
WIOPT
2006
IEEE
16 years 25 days ago
Capacity optimizing hop distance in a mobile ad hoc network with power control
Abstract— In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a c...
Dinesh Kumar 0002, Venkatesh Ramaiyan, Anurag Kuma...
WECWIS
2005
IEEE
94views ECommerce» more  WECWIS 2005»
16 years 12 days ago
Truthful Online Auctions for Pricing Peer-to-Peer Services
We consider truthful online auctions that aim at optimizing sellers’ revenues, representing service contributors’ satisfactions, as a general model for pricing peer-to-peer se...
Po-An Chen, Tyng-Ruey Chuang
STACS
2005
Springer
16 years 9 days ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
16 years 9 days ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
ECCV
2010
Springer
16 years 5 days ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...