1254 search results - page 41 / 251 » Making Hard Problems Harder |
115
click to vote
TOOLS
1998
IEEE
15 years 4 months ago
1998
IEEE
Since the publication of the Design Patterns book, a large number of design patterns have been identified and codified. Unfortunately, these patterns are mostly organised in an ad...
86
Voted
IPL
2008
15 years 16 days ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
CP
2010
Springer
14 years 11 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
137
Voted
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...
105
Voted
OL
2007
15 years 23 hour ago
2007
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...