556 search results - page 90 / 112 » Pair Programming: Not for Everyone |
UIST
1994
ACM
14 years 1 months ago
1994
ACM
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...
ASIAN
2006
Springer
14 years 28 days ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
ALENEX
2007
13 years 10 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
IPCO
2010
13 years 10 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
BIOCOMP
2006
13 years 10 months ago
2006
Currently, the genome sequencing community is producing shotgun sequence data at a very high rate, but genome finishing is not keeping pace, even with the help from several automa...