Sciweavers

6142 search results - page 401 / 1229
» The Complexity of Partition Functions
Sort
View
APVIS
2006
15 years 8 months ago
Interactive optimization in cooperative environments
In the present paper, we introduce a multi-user interactive framework for solving complex optimization problems. The framework, called Co-UserHints, provides a visual computationa...
Joelma de Moura Ferreira, Hugo A. D. do Nascimento...
IPL
2006
74views more  IPL 2006»
15 years 6 months ago
Periodic and Sturmian languages
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as ...
Lucian Ilie, Solomon Marcus, Ion Petre
WWW
2008
ACM
16 years 7 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
EMSOFT
2009
Springer
16 years 1 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
IWCIA
2009
Springer
16 years 1 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...