304 search results - page 49 / 61 » Exploiting problem structure in a genetic algorithm approach... |
CG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
SDM
2010
SIAM
13 years 6 months ago
2010
SIAM
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
PVLDB
2008
13 years 6 months ago
2008
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Node mobility and end-to-end disconnections in Delay Tolerant Networks (DTNs) greatly impair the effectiveness of data dissemination. Although social-based approaches can be used ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...