4110 search results - page 83 / 822 » Efficient algorithms for the 2-gathering problem |
109
click to vote
RP
2010
Springer
15 years 1 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
118
click to vote
TACAS
2010
Springer
15 years 1 months ago
2010
Springer
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
114
click to vote
WSC
1998
15 years 5 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
140
click to vote
CPAIOR
2004
Springer
15 years 7 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
123
click to vote
ISAAC
1992
Springer
15 years 8 months ago
1992
Springer
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...