Sciweavers

3495 search results - page 34 / 699
» On the random satisfiable process
Sort
View
SODA
2010
ACM
186views Algorithms» more  SODA 2010»
15 years 2 months ago
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
SAT
2004
Springer
117views Hardware» more  SAT 2004»
15 years 9 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher
115
Voted
ECIR
2004
Springer
15 years 5 months ago
Applying the Divergence from Randomness Approach for Content-Only Search in XML Documents
Content-only retrieval of XML documents deals with the problem of locating the smallest XML elements that satisfy the query. In this paper, we investigate the application of a spec...
Mohammad Abolhassani, Norbert Fuhr
126
Voted
RSA
2011
126views more  RSA 2011»
14 years 11 months ago
Local resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
József Balogh, Béla Csaba, Wojciech ...
TMC
2012
13 years 6 months ago
Distributed Throughput Maximization in Wireless Networks via Random Power Allocation
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
Hyang-Won Lee, Eytan Modiano, Long Bao Le