Sciweavers

3499 search results - page 200 / 700
» On the local optimality of LambdaRank
Sort
View
ATAL
2010
Springer
15 years 2 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
112
Voted
WIMOB
2008
IEEE
15 years 8 months ago
Rate Allocation with Lifetime Maximization and Fairness for Data Aggregation in Sensor Networks
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
Shouwen Lai, Binoy Ravindran, Hyeonjoong Cho
CODES
2000
IEEE
15 years 6 months ago
Co-design of interleaved memory systems
Memory interleaving is a cost-efficient approach to increase bandwidth. Improving data access locality and reducing memory access conflicts are two important aspects to achieve hi...
Hua Lin, Wayne Wolf
93
Voted
TCS
2008
15 years 1 months ago
The complexity of deciding reachability properties of distributed negotiation schemes
Distributed negotiation schemes offer one approach to agreeing an allocation of resources among a set of individual agents. Such schemes attempt to agree a distribution via a sequ...
Paul E. Dunne, Yann Chevaleyre
ICPR
2006
IEEE
16 years 2 months ago
Automatic Adjustment of Discriminant Adaptive Nearest Neighbor
K-Nearest Neighbors relies on the definition of a global metric. In contrast, Discriminant Adaptive Nearest Neighbor (DANN) computes a different metric at each query point based o...
Cédric Archambeau, Michel Verleysen, Nicola...