Sciweavers

15033 search results - page 2870 / 3007
» Complexity Theory and Algorithms
Sort
View
167
Voted
ACST
2006
15 years 5 months ago
PDC: Pattern discovery with confidence in DNA sequences
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Yan Sun, Zijia...
CAINE
2006
15 years 5 months ago
A multiobjective evolutionary approach for constrained joint source code optimization
The synergy of software and hardware leads to efficient application expression profile (AEP) not only in terms of execution time and energy but also optimal architecture usage. We...
Naeem Zafar Azeemi
DLOG
2006
15 years 5 months ago
Tableau Caching for Description Logics with Inverse and Transitive Roles
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
Yu Ding, Volker Haarslev
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
15 years 5 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
FLAIRS
1998
15 years 5 months ago
Analytical Design of Reinforcement Learning Tasks
Reinforcement learning (RL) problems constitute an important class of learning and control problems faced by artificial intelligence systems. In these problems, one is faced with ...
Robert E. Smith
« Prev « First page 2870 / 3007 Last » Next »