Sciweavers

4940 search results - page 272 / 988
» On the Complexity of Universal Programs
Sort
View
ORL
1998
68views more  ORL 1998»
15 years 6 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
SENSYS
2006
ACM
16 years 16 days ago
Protothreads: simplifying event-driven programming of memory-constrained embedded systems
Event-driven programming is a popular model for writing programs for tiny embedded systems and sensor network nodes. While event-driven programming can keep the memory overhead do...
Adam Dunkels, Oliver Schmidt, Thiemo Voigt, Muneeb...
IWPC
2003
IEEE
15 years 12 months ago
Facilitating Program Comprehension by Mining Association Rules from Source Code
Program comprehension is an important part of software maintenance, especially when program structure is complex and documentation is unavailable or outdated. Data mining can prod...
Christos Tjortjis, Loukas Sinos, Paul J. Layzell
ENTCS
2008
175views more  ENTCS 2008»
15 years 6 months ago
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System
A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming a...
Cezara Dragoi, Gheorghe Stefanescu
GPEM
2000
121views more  GPEM 2000»
15 years 6 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang