Sciweavers

8413 search results - page 191 / 1683
» Ordering Problem Subgoals
Sort
View
ICDE
2012
IEEE
212views Database» more  ICDE 2012»
12 years 1 months ago
Attribute-Based Subsequence Matching and Mining
—Sequence analysis is very important in our daily life. Typically, each sequence is associated with an ordered list of elements. For example, in a movie rental application, a cus...
Yu Peng, Raymond Chi-Wing Wong, Liangliang Ye, Phi...
CLASSIFICATION
2006
103views more  CLASSIFICATION 2006»
13 years 10 months ago
On the Complexity of Ordinal Clustering
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
Rahul Shah, Martin Farach-Colton
JAIR
2007
141views more  JAIR 2007»
13 years 10 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
ESE
2000
102views Database» more  ESE 2000»
13 years 10 months ago
Picking the Right Problem Frame-An Empirical Study
Problem frames are a relatively new approach to requirements engineering, promising benefits not only in elicitation but also in subsequent design, by allowing their users to selec...
Keith Phalp, Karl Cox
AAAI
2006
14 years 5 days ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...