4839 search results - page 902 / 968 » A survey of computational complexity results in systems and ... |
164
click to vote
ECCV
2004
Springer
16 years 3 months ago
2004
Springer
The problem of tracking a varying number of non-rigid objects has two major difficulties. First, the observation models and target distributions can be highly non-linear and non-Ga...
101
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
139
click to vote
COCO
1994
Springer
15 years 5 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
111
click to vote
FAST
2008
15 years 4 months ago
2008
Ever-increasing complexity of large-scale applications and continuous increases in sizes of the data they process make the problem of maximizing performance of such applications a...
120
click to vote
ICFEM
2009
Springer
14 years 11 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...