Sciweavers

7167 search results - page 591 / 1434
» Answer Set Programming
Sort
View
190
Voted
EC
2008
153views ECommerce» more  EC 2008»
15 years 5 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
RECOMB
2006
Springer
16 years 6 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
169
Voted
SIGSOFT
2006
ACM
16 years 6 months ago
Questions programmers ask during software evolution tasks
Though many tools are available to help programmers working on change tasks, and several studies have been conducted to understand how programmers comprehend systems, little is kn...
Jonathan Sillito, Gail C. Murphy, Kris De Volder
CHI
2009
ACM
16 years 6 months ago
Designing for discovery: opening the hood for open-source end user tinkering
According to the Free Software Movement, the user ought to have "the freedoms to make changes, and to publish improved versions" and "to study how the program works...
Gifford Cheung, Parmit Chilana, Shaun K. Kane, Bra...
CC
2010
Springer
190views System Software» more  CC 2010»
16 years 29 days ago
Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors?
On Chip Multiprocessors (CMP), it is common that multiple cores share certain levels of cache. The sharing increases the contention in cache and memory-to-chip bandwidth, further h...
Yunlian Jiang, Eddy Z. Zhang, Kai Tian, Xipeng She...