Sciweavers

814 search results - page 97 / 163
» Two-Phase Distributed Observation Problems
Sort
View
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
14 years 7 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
SOCIALCOM
2010
14 years 7 months ago
The Dynamics of Two Cognitive Heuristics for Coordination on Networks
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
Iyad Rahwan, Fatemeh Jahedpari, Sherief Abdallah
IOR
2010
128views more  IOR 2010»
14 years 7 months ago
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
The paper considers a stylized model of a dynamic assortment optimization problem, where given a limited capacity constraint, we must decide the assortment of products to offer to...
Paat Rusmevichientong, Zuo-Jun Max Shen, David B. ...
PODC
2005
ACM
15 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
CP
2005
Springer
15 years 3 months ago
Search Heuristics and Heavy-Tailed Behaviour
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
Tudor Hulubei, Barry O'Sullivan