464 search results - page 77 / 93 » Subsystem Based Generalizations of Rough Set Approximations |
CAV
2001
Springer
15 years 1 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
80
Voted
DEXA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
CIKM
2009
Springer
15 years 23 days ago
2009
Springer
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
AIPS
2003
14 years 10 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...