Sciweavers

230 search results - page 46 / 46
» Completing Herbelin's Programme
Sort
View
BMCBI
2010
143views more  BMCBI 2010»
13 years 5 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
CACM
1999
92views more  CACM 1999»
13 years 4 months ago
Putting OO Distributed Programming to Work
stractions underlying distributed computing. We attempted to keep our preaims at an abstract and general level. In this column, we make those claims more concrete. More precisely, ...
Pascal Felber, Rachid Guerraoui, Mohamed Fayad
OOPSLA
2010
Springer
13 years 3 months ago
Managing ambiguity in programming by finding unambiguous examples
We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming env...
Kenneth C. Arnold, Henry Lieberman
OOPSLA
2010
Springer
13 years 3 months ago
Concurrency by modularity: design patterns, a case in point
General purpose object-oriented programs typically aren’t embarrassingly parallel. For these applications, finding enough concurrency remains a challenge in program design. To ...
Hridesh Rajan, Steven M. Kautz, Wayne Rowcliffe
FPL
2010
Springer
124views Hardware» more  FPL 2010»
13 years 2 months ago
Finding System-Level Information and Analyzing Its Correlation to FPGA Placement
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
Farnaz Gharibian, Lesley Shannon, Peter Jamieson