Sciweavers

3211 search results - page 518 / 643
» On the Grundy Number of a Graph
Sort
View
CP
2003
Springer
14 years 2 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
14 years 2 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
PLDI
1990
ACM
14 years 1 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
DIALM
2007
ACM
110views Algorithms» more  DIALM 2007»
14 years 1 months ago
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, ...
SIGIR
2010
ACM
14 years 1 months ago
The importance of anchor text for ad hoc search revisited
It is generally believed that propagated anchor text is very important for effective Web search as offered by the commercial search engines. “Google Bombs” are a notable illus...
Marijn Koolen, Jaap Kamps