1346 search results - page 15 / 270 » Algorithmic Search for Flexibility Using Resultants of Polyn... |
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data source...
CIKM
2004
Springer
14 years 29 days ago
2004
Springer
Endeca’s approach to processing search queries in a distributed computing environment is predicated on concerns of correctness, scalability, and flexibility in deployment. Using...
GECCO
2004
Springer
14 years 28 days ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
EOR
2008
13 years 7 months ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...