Sciweavers

2887 search results - page 309 / 578
» Name Generation and Linearity
Sort
View
ISPDC
2005
IEEE
16 years 5 days ago
A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
Gabriel Paillard, Christian Antoine Louis Lavault,...
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
16 years 3 days ago
Discovering biological motifs with genetic programming
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...
Rolv Seehuus, Amund Tveit, Ole Edsberg
PKDD
2005
Springer
125views Data Mining» more  PKDD 2005»
16 years 2 days ago
A Propositional Approach to Textual Case Indexing
Abstract. Problem solving with experiences that are recorded in text form requires a mapping from text to structured cases, so that case comparison can provide informed feedback fo...
Nirmalie Wiratunga, Robert Lothian, Sutanu Chakrab...
ASPDAC
2004
ACM
112views Hardware» more  ASPDAC 2004»
16 years 11 hour ago
Longest path selection for delay test under process variation
- Under manufacturing process variation, a path through a fault site is called longest for delay test if there exists a process condition under which the path has the maximum delay...
Xiang Lu, Zhuo Li, Wangqi Qiu, D. M. H. Walker, We...
CSCLP
2004
Springer
15 years 12 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov