14649 search results - page 434 / 2930 » Principles of problem solving |
177
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
173
Voted
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
189
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
173
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— The tokamak concept for magnetic confinement of fusion plasmas is now quite mature scientifically. This maturity is evidenced by the ongoing worldwide effort to design and cons...
171
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this work we tackle the road sign problem with Reservoir Computing (RC) networks. The T-maze task (a particular form of the road sign problem) consists of a robot in a T-sha...