Sciweavers

7519 search results - page 1416 / 1504
» Optimizing Generic Functions
Sort
View
208
Voted
IJCV
2006
299views more  IJCV 2006»
15 years 2 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
JAIR
2008
104views more  JAIR 2008»
15 years 2 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
CORR
2007
Springer
106views Education» more  CORR 2007»
15 years 2 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 2 months ago
Capacity of Sparse Multipath Channels in the Ultra-Wideband Regime
—This paper studies the ergodic capacity of time- and frequency-selective multipath fading channels in the ultrawideband (UWB) regime when training signals are used for channel e...
Vasanthan Raghavan, Gautham Hariharan, Akbar M. Sa...
124
Voted
JAIR
2006
134views more  JAIR 2006»
15 years 2 months ago
Multi-Issue Negotiation with Deadlines
This paper studies bilateral multi-issue negotiation between self-interested autonomous agents. Now, there are a number of different procedures that can be used for this process; ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
« Prev « First page 1416 / 1504 Last » Next »