Results 251 to 260 of about 2,090,361 (288)

Implementing Fast Heuristic Search Code

Proceedings of the International Symposium on Combinatorial Search, 2021
Published papers rarely disclose implementation details. In this paper we show how such details can account for speedups of up to a factor of 28 for different implementations of the same algorithm. We perform an in-depth analysis of the most popular benchmark in heuristic search: the 15-puzzle. We study implementation choices in C++ for
Ethan Burns, Matthew Hatem, Michael Leighton, Wheeler Ruml   +3 more
openaire   +1 more source

Tailbiting codes: bounds and search results

IEEE Transactions on Information Theory, 2002
Summary: Tailbiting trellis representations of linear block codes with an arbitrary sectionalization of the time axis are studied. The notations of regular and irregular tailbiting codes are introduced and their maximal state complexities are lower-bounded. The asymptotic behavior of the derived bound is investigated.
Bocharova, Irina E., Johannesson, Rolf, Kudryashov, Boris D., Ståhl, Per   +3 more
openaire   +2 more sources

Code hunt: searching for secret code for fun

Proceedings of the 7th International Workshop on Search-Based Software Testing, 2014
Learning to code can be made more effective and sustainable if it is perceived as fun by the learner. Code Hunt uses puzzles that players have to explore by means of clues presented as test cases. Players iteratively modify their code to match the functional behavior of secret solutions. This way of learning to code is very different to learning from a
Nikolai Tillmann, Judith Bishop, Nigel Horspool, Daniel Perelman, Tao Xie   +4 more
openaire   +1 more source

Retrieval on source code: a neural code search

Proceedings of the 2nd ACM SIGPLAN International Workshop on Machine Learning and Programming Languages, 2018
Searching over large code corpora can be a powerful productivity tool for both beginner and experienced developers because it helps them quickly find examples of code related to their intent. Code search becomes even more attractive if developers could express their intent in natural language, similar to the interaction that Stack Overflow supports. In
Saksham Sachdev, Hongyu Li, Sifei Luan, Seohyun Kim, Koushik Sen, Satish Chandra   +5 more
openaire   +1 more source

Preprocessing Code Example For Searching

Proceedings of the ASWEC 2015 24th Australasian Software Engineering Conference, 2015
Students who start learning to program often find it difficult to acquire programming concepts. Among all teaching materials, code example is favoured most by both teachers and students. A number of code examples can be found in on-line resources, such as TutorialsPoint and W3School, however, there is not much work on standardising good code examples ...
Duong Nhu, Caslon Chua
openaire   +1 more source

Toward social-technical code search

2013 6th International Workshop on Cooperative and Human Aspects of Software Engineering (CHASE), 2013
With the vast amount of source code that is publicly available today, searching for code has become an integral part of the programming experience. While a few dedicated code search engines are available, we contend in this paper that they have not nearly reached their full potential.
Lee Martie, Andre van der Hoek
openaire   +1 more source

Krugle Code Search Architecture

2013
Krugle was one of the earliest commercial portals for searching open source software. This chapter reviews the history of Krugle from initial inception to present day. It follows the search engine from the initial public version to the enterprise offering, with a particular focus on lessons learned from design decisions on topics such as web crawling ...
openaire   +1 more source

Tabu search in coding theory

Proceedings of 1995 IEEE International Symposium on Information Theory, 2002
Tabu search is a stochastic method for combinatorial optimization. It is shown how this method can be used to construct various record-breaking codes.
K.J. Nurmela, P.R.J. Ostergard
openaire   +1 more source

Fast coding unit partition search

2012 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), 2012
Quad tree based encoders do brute force search for finding out the best partition for Coding Unit (CU). This brute force search performs encoding for all the possible block sizes and selects the partition size that gives best compression. This search along with inherent complexity of the latest encoders makes it extremely difficult to attain real time ...
Satish Lokkoju, Dinesh Reddy
openaire   +1 more source

Homology Searches Using Supersecondary Structure Code

2019
Supersecondary structure code (SSSC), which is represented as the combination of α-helix-type (SSSC: H), β-sheet-type (SSSC: S), the other (SSSC: T), and disorder residue or C-terminal (SSSC: D) patterns, has been produced by the developed concept of Ramachandran plot, in addition, with the ω angle and with the specification of positions of torsion ...
openaire   +2 more sources