1264 search results - page 211 / 253 » Towards Theory Translation |
EWCBR
2006
Springer
14 years 15 days ago
2006
Springer
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
GECCO
2006
Springer
14 years 14 days ago
2006
Springer
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
ICSE
2000
IEEE-ACM
14 years 12 days ago
2000
IEEE-ACM
By the early 1990s the need for reengineering legacy systems was already acute, but recently the demand has increased significantly with the shift toward web-based user interfaces...
AAAI
2008
13 years 11 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
EMSOFT
2008
Springer
13 years 10 months ago
2008
Springer
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...