Sciweavers

850 search results - page 75 / 170
» heuristics 2006
Sort
View
JCO
2010
169views more  JCO 2010»
14 years 11 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
JUCS
2010
143views more  JUCS 2010»
14 years 11 months ago
Design of Arbiters and Allocators Based on Multi-Terminal BDDs
: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways...
Václav Dvorák, Petr Mikusek
105
Voted
MP
2010
116views more  MP 2010»
14 years 11 months ago
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
Konstantinos Kaparis, Adam N. Letchford
98
Voted
MT
2010
96views more  MT 2010»
14 years 11 months ago
Monte Carlo techniques for phrase-based translation
Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic translation models. We present an alternative ap...
Abhishek Arun, Barry Haddow, Philipp Koehn, Adam L...
78
Voted
RAS
2010
108views more  RAS 2010»
14 years 11 months ago
Swarm-supported outdoor localization with sparse visual data
— The localization of mobile systems with video data is a challenging field in robotic vision research. Apart from artificial environmental support technologies like GPS locali...
Marcel Kronfeld, Christian Weiss, Andreas Zell