Sciweavers

1272 search results - page 134 / 255
» The Set Cover with Pairs Problem
Sort
View
BMCBI
2007
105views more  BMCBI 2007»
13 years 10 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
ICLP
2004
Springer
14 years 4 months ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
ECIR
2010
Springer
14 years 6 days ago
A Case for Automatic System Evaluation
Ranking a set retrieval systems according to their retrieval effectiveness without relying on relevance judgments was first explored by Soboroff et al. [13]. Over the years, a numb...
Claudia Hauff, Djoerd Hiemstra, Leif Azzopardi, Fr...
PODC
2005
ACM
14 years 4 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ESA
2008
Springer
100views Algorithms» more  ESA 2008»
14 years 16 days ago
Improved Approximation Algorithms for Relay Placement
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
Alon Efrat, Sándor P. Fekete, Poornananda R...