Sciweavers

1309 search results - page 122 / 262
» On-Line Difference Maximization
Sort
View
125
Voted
COGSCI
2006
75views more  COGSCI 2006»
15 years 3 months ago
A Hierarchical Bayesian Model of Human Decision-Making on an Optimal Stopping Problem
We consider human performance on an optimal stopping problem where people are presented with a list of numbers independently chosen from a uniform distribution. People are told ho...
Michael D. Lee
ECCC
2006
99views more  ECCC 2006»
15 years 3 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
137
Voted
HEURISTICS
2006
120views more  HEURISTICS 2006»
15 years 3 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
CORR
2007
Springer
99views Education» more  CORR 2007»
15 years 3 months ago
Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks
Abstract- We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source ...
Lawrence Ong, Mehul Motani
96
Voted
JSAC
2006
107views more  JSAC 2006»
15 years 3 months ago
Efficiency and Braess' Paradox under pricing in general networks
We study the flow control and routing decisions of self-interested users in a general congested network where a single profit-maximizing service provider sets prices for different ...
Xin Huang, Asuman E. Ozdaglar, Daron Acemoglu