Sciweavers

13987 search results - page 507 / 2798
» The Two Guards Problem
Sort
View
174
Voted
COCOON
2005
Springer
16 years 18 days ago
Finding Longest Increasing and Common Subsequences in Streaming Data
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
David Liben-Nowell, Erik Vee, An Zhu
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
16 years 17 days ago
A multi-objective genetic algorithm for robust design optimization
Real-world multi-objective engineering design optimization problems often have parameters with uncontrollable variations. The aim of solving such problems is to obtain solutions t...
Mian Li, Shapour Azarm, Vikrant Aute
DIALM
2004
ACM
117views Algorithms» more  DIALM 2004»
16 years 15 days ago
OVSF-CDMA code assignment in wireless ad hoc networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreading...
Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder
AMAI
2004
Springer
16 years 14 days ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
ICTCS
2003
Springer
16 years 8 days ago
Cost Constrained Fixed Job Scheduling
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
Qiwei Huang, Errol L. Lloyd