14386 search results - page 313 / 2878 » The Chinese Generals Problem |
115
click to vote
ICSE
2008
IEEE-ACM
16 years 5 months ago
2008
IEEE-ACM
Central to the problem frames approach is the distinction of three different descriptions: requirements R, domain assumptions W and specifications S, tied together with the socall...
133
click to vote
PLDI
2010
ACM
16 years 2 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 ...
135
click to vote
EUROSYS
2006
ACM
16 years 2 months ago
2006
ACM
Computer problem diagnosis remains a serious challenge to users and support professionals. Traditional troubleshooting methods relying heavily on human intervention make the proce...
147
Voted
GECCO
2009
Springer
15 years 11 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...
152
click to vote
MFCS
2009
Springer
15 years 11 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...