Sciweavers

1272 search results - page 133 / 255
» The Set Cover with Pairs Problem
Sort
View
89
Voted
ICALP
2009
Springer
16 years 28 days ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
103
Voted
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
15 years 23 days ago
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation"
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
Hadrien Cambazard, Barry O'Sullivan
IEEESCC
2009
IEEE
14 years 10 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
104
Voted
BMCBI
2007
105views more  BMCBI 2007»
15 years 23 days ago
Predicting RNA secondary structure by the comparative approach: how to select the homologous sequences
Background: The secondary structure of an RNA must be known before the relationship between its structure and function can be determined. One way to predict the secondary structur...
Stefan Engelen, Fariza Tahi
IJBRA
2008
66views more  IJBRA 2008»
15 years 20 days ago
Integer programming-based approach to allocation of reporter genes for cell array analysis
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
Morihiro Hayashida, Fuyan Sun, Sachiyo Aburatani, ...