Sciweavers

1064 search results - page 89 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
ICML
2010
IEEE
15 years 5 months ago
Inverse Optimal Control with Linearly-Solvable MDPs
We present new algorithms for inverse optimal control (or inverse reinforcement learning, IRL) within the framework of linearlysolvable MDPs (LMDPs). Unlike most prior IRL algorit...
Dvijotham Krishnamurthy, Emanuel Todorov
CEC
2007
IEEE
15 years 10 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
TLCA
2009
Springer
15 years 10 months ago
Session-Based Communication Optimisation for Higher-Order Mobile Processes
In this paper we solve an open problem posed in our previous work on asynchronous subtyping [12], extending the method to higher-order session communication and functions. Our syst...
Dimitris Mostrous, Nobuko Yoshida
168
Voted
ECP
1997
Springer
128views Robotics» more  ECP 1997»
15 years 8 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
COCOON
2005
Springer
15 years 9 months ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee