Sciweavers

2100 search results - page 22 / 420
» Fundamentals of the problem
Sort
View
ACL
2007
13 years 9 months ago
Forest Rescoring: Faster Decoding with Integrated Language Models
Efficient decoding has been a fundamental problem in machine translation, especially with an integrated language model which is essential for achieving good translation quality. ...
Liang Huang, David Chiang
JC
2000
78views more  JC 2000»
13 years 7 months ago
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
Fabrice Rouillier, Marie-Françoise Roy, Moh...
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 5 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer
WDAG
2001
Springer
78views Algorithms» more  WDAG 2001»
14 years 5 days ago
Self Stabilizing Distributed Queuing
Distributed queuing is a fundamental coordination problem, arising in a variety of applications, including distributed shared memory, distributed directories, and totally ordered ...
Maurice Herlihy, Srikanta Tirthapura
CEC
2008
IEEE
13 years 9 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ