2233 search results - page 261 / 447 » On the Complexity of Theory Curbing |
174
click to vote
GECCO
2007
Springer
16 years 20 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
179
click to vote
GECCO
2007
Springer
16 years 20 days ago
2007
Springer
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...
156
click to vote
ICFCA
2007
Springer
16 years 20 days ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
142
click to vote
ICMCS
2006
IEEE
16 years 17 days ago
2006
IEEE
This paper proposes error resilient video transcoding structures based on the multiple description (MD) scheme. Two structures are proposed for different use, namely low complexit...
159
click to vote
INFOCOM
2006
IEEE
16 years 16 days ago
2006
IEEE
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...