2647 search results - page 91 / 530 » Solving Term Inequalities |
107
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Building upon the interactive inversion method introduced by Ashburn and Bonabeau (2004), we show how to dramatically improve the results by exploiting modularity and by letting t...
132
click to vote
SIGCSE
2004
ACM
15 years 9 months ago
2004
ACM
This paper describes two design patterns that are powerful tools to help teach how semaphores are used to solve synchronization problems. The patterns are general enough to be use...
137
click to vote
CADE
2001
Springer
15 years 8 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
130
click to vote
DEXA
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we present a novel frequent generalized pattern mining algorithm, called GP-Close, for mining generalized associations from RDF metadata. To solve the overgeneraliz...
112
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
The paper presents the parameter-less implementation of an evolutionary-based search. It does not need any predefined control parameters values, which are usually used for geneti...