1190 search results - page 169 / 238 » On the Structure of Syntenic Distance |
CP
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
EUROPAR
2004
Springer
14 years 2 months ago
2004
Springer
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
WEA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
ICPP
2003
IEEE
14 years 2 months ago
2003
IEEE
Automatic optimization of address offset assignment for DSP applications, which reduces the number of address arithmetic instructions to meet the tight memory size restrictions an...
INFOCOM
2003
IEEE
14 years 2 months ago
2003
IEEE
— Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general app...