Sciweavers

893 search results - page 5 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
AAAI
1998
13 years 9 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...
EVOW
2006
Springer
13 years 11 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...
CIE
2008
Springer
13 years 9 months ago
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
Marcin Jurdzinski, Rahul Savani
COLT
1995
Springer
13 years 11 months ago
A Comparison of New and Old Algorithms for a Mixture Estimation Problem
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
David P. Helmbold, Yoram Singer, Robert E. Schapir...
ICIP
2009
IEEE
13 years 5 months ago
Device temporal forensics: An information theoretic approach
By formulating the problem of ordering the outputs observed from a device over time, we pose a new problem in forensics and propose a framework for addressing this problem of devi...
Junwen Mao, Orhan Bulan, Gaurav Sharma, Suprakash ...