Sciweavers

1951 search results - page 100 / 391
» An algorithm for improving graph partitions
Sort
View
GECCO
2003
Springer
116views Optimization» more  GECCO 2003»
15 years 9 months ago
A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
Dong-il Seo, Byung Ro Moon
UAI
2004
15 years 5 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
EMNLP
2006
15 years 5 months ago
Learning Field Compatibilities to Extract Database Records from Unstructured Text
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
Michael L. Wick, Aron Culotta, Andrew McCallum
156
Voted
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 5 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
ALGOSENSORS
2009
Springer
15 years 11 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal