Sciweavers

4797 search results - page 179 / 960
» The complexity of partition tasks
Sort
View
CISIS
2009
IEEE
15 years 4 months ago
Making Expert Knowledge Explicit to Facilitate Tool Support for Integrating Complex Information Systems in the ATM Domain
The capability to provide a platform for flexible business services in the Air Traffic Management (ATM) domain is both a major success factor for the ATM industry and a challenge ...
Thomas Moser, Richard Mordinyi, Alexander Mikula, ...
CORR
2011
Springer
144views Education» more  CORR 2011»
15 years 1 months ago
Schema Redescription in Cellular Automata: Revisiting Emergence in Complex Systems
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
Manuel Marques-Pita, Luis Mateus Rocha
DISOPT
2011
210views Education» more  DISOPT 2011»
15 years 1 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
DAC
2009
ACM
16 years 7 months ago
Non-intrusive dynamic application profiling for multitasked applications
Application profiling ? the process of monitoring an application to determine the frequency of execution within specific regions ? is an essential step within the design process f...
Karthik Shankar, Roman L. Lysecky
ICDM
2009
IEEE
165views Data Mining» more  ICDM 2009»
16 years 1 months ago
Cross-Guided Clustering: Transfer of Relevant Supervision across Domains for Improved Clustering
—Lack of supervision in clustering algorithms often leads to clusters that are not useful or interesting to human reviewers. We investigate if supervision can be automatically tr...
Indrajit Bhattacharya, Shantanu Godbole, Sachindra...