David Andre

dblp:62/2522 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 4 first-authorSystems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Reinforcement learning · 54% Planning, search and constraint satisfaction · 32% Multi-agent systems · 14%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs › reconfigurable computing
evolvable hardware
0.011998
Evolving Computer Programs Using Rapidly Reconfigurable Field-Programmable Gate Arrays and Genetic Programming · FPGA 1998
Reconfigurable computing and FPGAs
reconfigurable computing
0.011998
Evolving Computer Programs Using Rapidly Reconfigurable Field-Programmable Gate Arrays and Genetic Programming · FPGA 1998
Machine learning › Reinforcement learning › model-based reinforcement learning › model-based planning
prioritized sweeping
0.011997
Generalized Prioritized Sweeping · NIPS 1997
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
search-based planning
0.011997
Generalized Prioritized Sweeping · NIPS 1997
Knowledge, reasoning and agents › Multi-agent systems › agent architecture
agent programming
0.011995
The Automatic Programming of Agents that Learn Mental Models and Create Simple Plans of Action · IJCAI (1) 1995
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
plan generation
0.011995
The Automatic Programming of Agents that Learn Mental Models and Create Simple Plans of Action · IJCAI (1) 1995
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.012000
Programmable Reinforcement Learning Agents · NIPS 2000
Algorithms and data structures › sequence algorithms › sorting
sorting networks
0.011998
Evolving Computer Programs Using Rapidly Reconfigurable Field-Programmable Gate Arrays and Genetic Programming · FPGA 1998

Methods — techniques the papers use, named apart from their topics

genetic programming · 0.0genetic algorithm · 0.0provably convergent learning algorithms · 0.0parameterized subroutines · 0.0prioritized sweeping · 0.0
YearPublicationVenuePosition
2011 Machine Learning and Sensor Fusion for Estimating Continuous Energy Expenditure
abstract
In this paper we provide insight into the BodyMedia FIT® armband system— a wearable multi-sensor technology that achieves the goals of continuous physiological monitoring (especially energy expenditure estimation) and weight management using machine learning and data modeling methods. This system has been commercially available since 2001 and more than half a million users have used the system to track their physiological parameters and to achieve their individual health goals including weight-loss. We describe several challenges that arise in applying machine learning techniques to the health care domain and present various solutions utilized in the armband system. We demonstrate how machine learning and multi-sensor data fusion techniques are critical to the system’s success.
Nisarg Vyas, Jonathan Farringdon, David Andre, John Ivo Stivoric
IAAI3
2006 A Compact, Hierarchical Q-function Decomposition
Bhaskara Marthi, Stuart Russell 0001, David Andre
UAI3
2000 Programmable Reinforcement Learning Agents
abstract
We present an expressive agent design language for reinforcement learn(cid:173) ing that allows the user to constrain the policies considered by the learn(cid:173) ing process.The language includes standard features such as parameter(cid:173) ized subroutines, temporary interrupts, aborts, and memory variables, but also allows for unspecified choices in the agent program. For learning that which isn't specified, we present provably convergent learning algo(cid:173) rithms. We demonstrate by example that agent programs written in the language are concise as well as modular. This facilitates state abstraction and the transferability of learned skills.
David Andre, Stuart Russell 0001
NIPS1
1999 Model based Bayesian Exploration
Richard Dearden, Nir Friedman, David Andre
UAI3
1999 Genetic programming III: darwinian invention and problem solving [Book Review]
John R. Koza, Forrest H. Bennett III, David Andre, Martin A. Keane
IEEE Trans. Evol. Comput.3
1998 Evolving Computer Programs Using Rapidly Reconfigurable Field-Programmable Gate Arrays and Genetic Programming
abstract
This paper describes how the massive parallelism of the rapidly reconfigurable Xilinx XC6216 FPGA (in conjunction with Virtual Computing's H.O.T. Works board) can be exploited to accelerate the time-consuming fitness measurement task of genetic algorithms and genetic programming. This acceleration is accomplished by embodying each individual of the evolving population into hardware in order to perform the fitness measurement task. A 16-step sorting network for seven items was evolved that has two fewer steps than the sorting network described in the 1962 O'Connor and Nelson patent on sorting networks (and the same number of steps as a 7-sorter that was devised by Floyd and Knuth subsequent to the patent and that is now known to be minimal). Other minimal sorters have been evolved.
John R. Koza, Forrest H. Bennett III, Jeffrey L. Hutchings, Stephen L. Bade, Martin A. Keane, David Andre
FPGA6
1998 Evolving Team Darwin United
David Andre, Astro Teller
RoboCup1
1998 A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance
David Andre, John R. Koza
Inf. Sci.1
1997 Generalized Prioritized Sweeping
David Andre, Nir Friedman, Ronald Parr
NIPS1
1997 Automated synthesis of analog electrical circuits by means of genetic programming
abstract
Analog circuit synthesis entails the creation of both the topology and the sizing (numerical values) of all of the circuit's components. This paper presents a single uniform approach using genetic programming for the automatic synthesis of both the topology and sizing of a suite of eight different prototypical analog circuits, including a low-pass filter, a crossover filter, a source identification circuit, an amplifier, a computational circuit, a time-optimal controller circuit, a temperature-sensing circuit, and a voltage reference circuit. The problem-specific information required for each of the eight problems is minimal and consists of the number of inputs and outputs of the desired circuit, the types of available components, and a fitness measure that restates the high-level statement of the circuit's desired behavior as a measurable mathematical quantity. The eight genetically evolved circuits constitute an instance of an evolutionary computation technique producing results on a task that is usually thought of as requiring human intelligence.
John R. Koza, Forrest H. Bennett III, David Andre, Martin A. Keane, Frank Dunlap
IEEE Trans. Evol. Comput.3
1995 The Automatic Programming of Agents that Learn Mental Models and Create Simple Plans of Action
David Andre
IJCAI (1)1