10051 search results - page 333 / 2011 » A Dynamic Separator Algorithm |
234
click to vote
ACL
2012
13 years 9 months ago
2012
We introduce a spectral learning algorithm for latent-variable PCFGs (Petrov et al., 2006). Under a separability (singular value) condition, we prove that the method provides cons...
183
click to vote
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
165
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
Energy has become a scarce and expensive resource. There is a growing awareness in society that energy saving is a critical issue. This paper surveys algorithmic solutions to reduc...
153
click to vote
FOCM
2006
15 years 6 months ago
2006
We introduce some modifications and extensions of the concept od index pair in the Conley index theory. We then show how these concepts may be used to overcome some difficulties in...
182
Voted
DAM
2002
15 years 6 months ago
2002
It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be ...