Sciweavers

406 search results - page 41 / 82
» Gadgets, Approximation, and Linear Programming
Sort
View
KR
1992
Springer
14 years 1 months ago
Order of Magnitude Reasoning using Logarithms
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
P. Pandurang Nayak
AUTOMATICA
1999
145views more  AUTOMATICA 1999»
13 years 9 months ago
Control of systems integrating logic, dynamics, and constraints
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
Alberto Bemporad, Manfred Morari
NIPS
2001
13 years 11 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 11 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
CDC
2009
IEEE
121views Control Systems» more  CDC 2009»
14 years 2 months ago
Piecewise-linear constrained control for timed continuous Petri nets
— Timed Continuous Petri Net (TCPN) systems are piecewise linear models with input constraints that can approximate the dynamical behavior of a class of timed discrete event syst...
Carlos Renato Vázquez, Manuel Silva