Sciweavers

3172 search results - page 192 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CIE
2010
Springer
15 years 11 months ago
The Strength of the Besicovitch-Davies Theorem
A theorem of Besicovitch and Davies implies for Cantor space 2ω that each Σ1 1 (analytic) class of positive Hausdorff dimension contains a Π0 1 (closed) subclass of positive di...
Bjørn Kjos-Hanssen, Jan Reimann
CPAIOR
2010
Springer
15 years 11 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
ESWS
2010
Springer
15 years 11 months ago
Making the Semantic Data Web Easily Writeable with RDFauthor
Abstract. In this demo we present RDFauthor, an approach for authoring information that adheres to the RDF data model. RDFauthor completely hides syntax as well as RDF and ontology...
Sebastian Tramp, Norman Heino, Sören Auer, Ph...
MOMM
2009
ACM
163views Communications» more  MOMM 2009»
15 years 11 months ago
Tools for designing and prototyping activity-based pervasive applications
This paper proposes a new approach for modelling, testing and prototyping pervasive, possibly mobile, and distributed applications. It describes a set of tools aimed at supporting...
Pascal Bruegger, Denis Lalanne, Agnes Lisowska, B&...
CTRSA
2001
Springer
109views Cryptology» more  CTRSA 2001»
15 years 11 months ago
Uncheatable Distributed Computations
Computationally expensive tasks that can be parallelized are most efficiently completed by distributing the computation among a large number of processors. The growth of the Intern...
Philippe Golle, Ilya Mironov