14518 search results - page 240 / 2904 » Two Problems for Sophistication |
102
click to vote
COMPGEOM
1997
ACM
15 years 5 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
106
Voted
ANTSW
2006
Springer
15 years 4 months ago
2006
Springer
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...
84
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
93
Voted
GCB
2000
Springer
15 years 4 months ago
2000
Springer
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
104
click to vote
AIPS
2008
15 years 3 months ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...