9842 search results - page 372 / 1969 » Problem complexity |
206
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
193
click to vote
IAT
2005
IEEE
16 years 15 days ago
2005
IEEE
Cooperative negotiation is proved to be an effective paradigm to solve complex dynamic multi-objective problems in which each objective is associated to an agent. When the multi-o...
162
click to vote
APPT
2003
Springer
16 years 4 days ago
2003
Springer
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
156
click to vote
ITNG
2007
IEEE
16 years 1 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
181
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...