Sciweavers

585 search results - page 91 / 117
» Better Abstractions for Timed Automata
Sort
View
CLA
2004
14 years 11 months ago
Using Concept Formal Analysis for Cooperative Information Retrieval
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
Ibtissem Nafkha, Samir Elloumi, Ali Jaoua
OPODIS
2004
14 years 11 months ago
Task Assignment Based on Prioritising Traffic Flows
Abstract. We consider the issue of task assignment in a distributed system under heavy-tailed (ie. highly variable) workloads. A new adaptable approach called TAPTF (Task Assignmen...
James Broberg, Zahir Tari, Panlop Zeephongsekul
AAAI
1998
14 years 10 months ago
Highest Utility First Search Across Multiple Levels of Stochastic Design
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
Louis I. Steinberg, J. Storrs Hall, Brian D. Davis...
CLEF
2010
Springer
14 years 10 months ago
Patent Classification Experiments with the Linguistic Classification System LCS
In the context of the CLEF-IP 2010 classification task, we conducted a series of experiments with the Linguistic Classification System (LCS). We compared ment representations for p...
Suzan Verberne, Merijn Vogel, Eva D'hondt
DATAMINE
2010
120views more  DATAMINE 2010»
14 years 9 months ago
A weighted voting summarization of SOM ensembles
Abstract Weighted Voting Superposition (WeVoS) is a novel summarization algorithm for the results of an ensemble of Self-Organizing Maps. Its principal aim is to achieve the lowest...
Bruno Baruque, Emilio Corchado