Sciweavers

23 search results - page 4 / 5
» Exact Algorithms for NP-Hard Problems: A Survey
Sort
View
SOFSEM
2005
Springer
13 years 11 months ago
Discovering Treewidth
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Hans L. Bodlaender
IOR
2010
100views more  IOR 2010»
13 years 4 months ago
Integrated Production and Outbound Distribution Scheduling: Review and Extensions
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after...
Zhi-Long Chen
ACL
2003
13 years 7 months ago
Generalized Algorithms for Constructing Statistical Language Models
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
Cyril Allauzen, Mehryar Mohri, Brian Roark
IRI
2006
IEEE
13 years 11 months ago
Replacing full rectangles by dense rectangles: Concept lattices and attribute implications
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
Radim Belohlávek, Vilém Vychodil
ALT
2003
Springer
13 years 9 months ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann