The following pages link to Yen-Liang Chen (Q323382):
Displaying 28 items.
- Identifying conflict patterns to reach a consensus -- a novel group decision approach (Q323384) (← links)
- Mining association rules from imprecise ordinal data (Q834489) (← links)
- Mining maximum consensus sequences from group ranking data (Q1027615) (← links)
- Critical path in an activity network with time constraints (Q1278077) (← links)
- (Q1406689) (redirect page) (← links)
- Minimum time paths in a network with mixed time constraints. (Q1406690) (← links)
- Shipping problems with body clock constraints. (Q1423446) (← links)
- Finding the first \(K\) shortest paths in a time-window network. (Q1427091) (← links)
- Finding the critical path in an activity network with time-switch constraints (Q1579499) (← links)
- Mining generalized knowledge from ordered data through attribute-oriented induction techniques (Q1779551) (← links)
- Mining hybrid sequential patterns and sequential rules (Q1859987) (← links)
- Minimization of travel time and weighted number of stops in a traffic-light network (Q1869410) (← links)
- Algorithms for mining association rules in bag databases (Q1886762) (← links)
- Finding \(K\) shortest looping paths in a traffic-light network (Q1886860) (← links)
- A dynamic-programming algorithm for hierarchical discretization of continuous attributes (Q2384630) (← links)
- Conjecturable knowledge discovery: a fuzzy clustering approach (Q2446032) (← links)
- The first \(K\) shortest unique-arc walks in a traffic-light network (Q2486756) (← links)
- A new approach for discovering fuzzy quantitative sequential patterns in sequence databases (Q2495467) (← links)
- An overlapping cluster algorithm to provide non-exhaustive clustering (Q2497259) (← links)
- TASC: two-attribute-set clustering through decision tree construction (Q2503065) (← links)
- Finding \(K\) shortest looping paths with waiting time in a time--window network (Q2504439) (← links)
- Mining predecessor–successor rules from DAG data (Q3422187) (← links)
- Generalized Pipelined Tomlinson–Harashima Precoder Design Methodology With Build-In Arbitrary Speed-Up Factors (Q4570213) (← links)
- Iterative Superlinear-Convergence SVD Beamforming Algorithm and VLSI Architecture for MIMO-OFDM Systems (Q4573808) (← links)
- The first <i>K</i> minimum cost paths in a time-schedule network (Q4658384) (← links)
- Time analysis for planning a path in a time-window network (Q4661089) (← links)
- Finding theKth shortest path in a time-schedule network (Q4680459) (← links)
- Noise-free attribute-oriented induction (Q6086336) (← links)
