Sciweavers

3367 search results - page 207 / 674
» Incremental assignment problem
Sort
View
124
Voted
GI
2005
Springer
15 years 9 months ago
On the Signaling Overhead in Dynamic OFDMA Wireless Systems
: It is well known that dynamic OFDMA systems potentially increase the spectral efficiency of wireless systems. They exploit diversity effects in time, space, and frequency by ass...
James Gross, Adam Wolisz, Hans-Florian Geerdes
AAAI
2004
15 years 5 months ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman
AAAI
2000
15 years 5 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman
JPDC
2008
161views more  JPDC 2008»
15 years 3 months ago
Base station placement on boundary of a convex polygon
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...
Sasanka Roy, Debabrata Bardhan, Sandip Das
105
Voted
EOR
2007
77views more  EOR 2007»
15 years 3 months ago
A review of congestion models in the location of facilities with immobile servers
Capacity effects are investigated, particularly as regards congestion of facilities with immobile (or fixed) servers. A review is given of research to date in this area, togethe...
Brian Boffey, Roberto D. Galvão, Luis Gonza...