Sciweavers

1090 search results - page 54 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
84
Voted
STACS
2005
Springer
15 years 3 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
IJCAI
2007
14 years 11 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
ACL
2010
14 years 7 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
JDCTA
2010
148views more  JDCTA 2010»
14 years 4 months ago
Application Research on Optimal Path Based on Genetic Algorithm
At present, China's automobile logistics cost accounts for more than 20% of the production of motor vehicles. Therefore, lowering logistics cost by seeking its best path is a...
Lilin Fan, Huili Meng
CORR
2010
Springer
204views Education» more  CORR 2010»
14 years 9 months ago
Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...
Yuan Liu, Meixia Tao, Bin Li, Hui Shen