<--- Back to Details
First PageDocument Content
Operations research / Combinatorial optimization / Theoretical computer science / Convex optimization / A* search algorithm / Algorithm / NP / Linear programming / Belief propagation / Mean value analysis
Date: 2013-07-05 07:45:59
Operations research
Combinatorial optimization
Theoretical computer science
Convex optimization
A* search algorithm
Algorithm
NP
Linear programming
Belief propagation
Mean value analysis

BASIS PURSUIT IN SENSOR NETWORKS João F. C. Mota1,2 , João M. F. Xavier2 , Pedro M. Q. Aguiar2 , and Markus Püschel3 1 Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, USA 2

Add to Reading List

Source URL: www.ee.ucl.ac.uk

Download Document from Source Website

File Size: 85,48 KB

Share Document on Facebook

Similar Documents

Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm

Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm

DocID: 1vdZY - View Document

Automatic Power System Restoration Application of a Search Algorithm Lars Lindgren

Automatic Power System Restoration Application of a Search Algorithm Lars Lindgren

DocID: 1up2e - View Document

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

DocID: 1ueLR - View Document

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

DocID: 1tFfm - View Document

________________________________ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem Gerardo Berbeglia Jean-François Cordeau

________________________________ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem Gerardo Berbeglia Jean-François Cordeau

DocID: 1tqh4 - View Document