400 search results - page 67 / 80 » What Makes a Problem GP-Hard |
EDCC
2010
Springer
14 years 6 days ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
CCO
2001
Springer
13 years 12 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
SIGOPSE
1998
ACM
13 years 11 months ago
1998
ACM
The majority of work on protection in single-language mobile code environments focuses on information security issues and depends on the language environment for solutions to the ...
VL
1997
IEEE
13 years 11 months ago
1997
IEEE
Visual programming approaches are limited in their usefulness if they do not include a profile of their users that defines exactly who is attempting to solve what kind of problems...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...