Sciweavers

929 search results - page 55 / 186
» heuristics 2008
Sort
View
EMNLP
2008
13 years 9 months ago
Sampling Alignment Structure under a Bayesian Translation Model
We describe the first tractable Gibbs sampling procedure for estimating phrase pair frequencies under a probabilistic model of phrase alignment. We propose and evaluate two nonpar...
John DeNero, Alexandre Bouchard-Côté,...
CMOT
2000
123views more  CMOT 2000»
13 years 7 months ago
Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models
A variety of different multi-agent (competitive) network models have been described in the literature. Computational techniques for solving such models often involve the iterative...
Steven A. Gabriel, David Bernstein
CDES
2008
87views Hardware» more  CDES 2008»
13 years 9 months ago
Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
DM
2008
88views more  DM 2008»
13 years 7 months ago
Packing triangles in low degree graphs and indifference graphs
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
Gordana Manic, Yoshiko Wakabayashi
ECRTS
2008
IEEE
14 years 2 months ago
Period and Deadline Selection for Schedulability in Real-Time Systems
Task period adaptations are often used to alleviate temporal overload conditions in real-time systems. Existing frameworks assume that only task periods are adjustable and that ta...
Thidapat Chantem, Xiaofeng Wang, Michael D. Lemmon...