Sciweavers

1494 search results - page 244 / 299
» Less Extreme Programming
Sort
View
AI
1999
Springer
15 years 1 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...
NETWORKS
2010
15 years 20 days ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
TSE
2010
140views more  TSE 2010»
15 years 18 days ago
Learning a Metric for Code Readability
—In this paper, we explore the concept of code readability and investigate its relation to software quality. With data collected from 120 human annotators, we derive associations...
Raymond P. L. Buse, Westley Weimer
124
Voted
CGO
2010
IEEE
15 years 8 days ago
On improving heap memory layout by dynamic pool allocation
Dynamic memory allocation is widely used in modern programs. General-purpose heap allocators often focus more on reducing their run-time overhead and memory space utilization, but...
Zhenjiang Wang, Chenggang Wu, Pen-Chung Yew
IFIPTCS
2010
15 years 5 days ago
A Semiring-Based Trace Semantics for Processes with Applications to Information Leakage Analysis
Abstract. We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from...
Michele Boreale, David Clark, Daniele Gorla