Sciweavers

556 search results - page 65 / 112
» Pair Programming: Not for Everyone
Sort
View
GLOBECOM
2006
IEEE
14 years 3 months ago
Sensor Localization from WLS Optimization with Closed-form Gradient and Hessian
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
Giuseppe Destino, Giuseppe Thadeu Freitas de Abreu
COMPSAC
2005
IEEE
14 years 2 months ago
Parallel Changes: Detecting Semantic Interferences
Parallel changes are a basic fact of modern software development. Where previously we looked at prima facie interference, here we investigate a less direct form that we call seman...
G. Lorenzo Thione, Dewayne E. Perry
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
14 years 2 months ago
Inferring Type Isomorphisms Generically
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
Frank Atanassow, Johan Jeuring
AGP
1997
IEEE
14 years 1 months ago
Sharing Revisited
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes setsharing. In thi...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
RECOMB
1997
Springer
14 years 1 months ago
Progressive multiple alignment with constraints
A progressive alignment algorithm produces a multi-alignment of a set of sequences by repeatedly aligning pairs of sequences and/or previously generated alignments. We describe a ...
Gene Myers, Sanford Selznick, Zheng Zhang 0004, We...