Sciweavers

453 search results - page 36 / 91
» On Approximation of Bookmark Assignments
Sort
View
COCOON
2005
Springer
13 years 10 months ago
On-Line Algorithms for Market Equilibria
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
Spyros Angelopoulos, Atish Das Sarma, Avner Magen,...
COMCOM
2004
99views more  COMCOM 2004»
13 years 8 months ago
Performance analysis of a mobile communication network: the tandem case
This paper investigates mobile communication networks consisting of N-cells in tandem. Two models with fixed channel assignment are considered, which correspond to (A) a uni-direc...
Attahiru Sule Alfa, Bin Liu
ICML
2008
IEEE
14 years 9 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
INFOCOM
1997
IEEE
14 years 1 months ago
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
Robert L. Carter, Mark Crovella
INFOCOM
2003
IEEE
14 years 2 months ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos