314 search results - page 20 / 63 » Complete Problems for Dynamic Complexity Classes |
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— This paper introduces the optimization of a Quantum Control application, the so-called molecular alignment problem, subject to a dynamic environment. Given the relative...
66
Voted
ICTAI
2005
IEEE
15 years 3 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
WSC
2000
14 years 11 months ago
2000
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
106
click to vote
ICIP
2000
IEEE
15 years 10 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
COCO
2008
Springer
14 years 11 months ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...