Sciweavers

2487 search results - page 100 / 498
» cases 2009
Sort
View
CCIA
2009
Springer
15 years 1 months ago
A Cryptographic Solution for Private Distributed Simple Meeting Scheduling
Meeting Scheduling is a suitable application for distributed computation, motivated by its privacy requirements. Previous work on this problem have considered some cryptographic te...
Javier Herranz, Stan Matwin, Pedro Meseguer, Jordi...
90
Voted
CORIA
2009
15 years 1 months ago
Recherche contextuelle d'information dans un environnement mobile
The goal of contextual information retrieval (CIR) is to better meet the user's needs by delivering him information adapted to his specific search context. This paper presents...
Ourdia Bouidghaghen
CCCG
2009
14 years 10 months ago
On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
Jürgen Bokowski, Vincent Pilaud
125
Voted
CEC
2009
IEEE
14 years 10 months ago
Analysis of constant creation techniques on the binomial-3 problem with grammatical evolution
This paper studies the difference between Persistent Random Constants (PRC) and Digit Concatenation as methods for generating constants. It has been shown that certain problems hav...
Jonathan Byrne, Michael O'Neill, Erik Hemberg, Ant...
123
Voted
DATESO
2009
114views Database» more  DATESO 2009»
14 years 10 months ago
Speeding Up Shortest Path Search in Public Transport Networks
Abstract. The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that sp...
Vladislav Martinek, Michal Zemlicka