Sciweavers

1054 search results - page 207 / 211
» Capacitated Domination Problem
Sort
View
BMCBI
2004
135views more  BMCBI 2004»
13 years 7 months ago
Information assessment on predicting protein-protein interactions
Background: Identifying protein-protein interactions is fundamental for understanding the molecular machinery of the cell. Proteome-wide studies of protein-protein interactions ar...
Nan Lin, Baolin Wu, Ronald Jansen, Mark Gerstein, ...
COMCOM
2004
108views more  COMCOM 2004»
13 years 7 months ago
Dynamic establishment of differentiated survivable lightpaths in WDM mesh networks
In the emerging next-generation transport networks, called intelligent optical transport networks, DWDM-based optical components like add-drop multiplexers and optical cross conne...
Chava Vijaya Saradhi, C. Siva Ram Murthy
JAIR
2000
123views more  JAIR 2000»
13 years 7 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
JCT
2000
111views more  JCT 2000»
13 years 7 months ago
Immanants and Finite Point Processes
Givena Hermitian,non-negativede nitekernelK and a character of the symmetric group on n letters, de ne the corresponding immanant function K x1;::: ;xn := P Qn i=1 Kxi;x i, where ...
Persi Diaconis, Steven N. Evans
CC
1998
Springer
111views System Software» more  CC 1998»
13 years 7 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson