Sciweavers

4009 search results - page 616 / 802
» Clustering on Complex Graphs
Sort
View
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
15 years 1 months ago
On optimal cooperative patrolling
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
HEURISTICS
2010
15 years 1 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
TGIS
2010
86views more  TGIS 2010»
15 years 1 months ago
A Road Network Selection Process Based on Data Enrichment and Structure Detection
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
Guillaume Touya
ICASSP
2011
IEEE
14 years 10 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
FOSSACS
2012
Springer
14 years 2 months ago
Concurrent Games with Ordered Objectives
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
Patricia Bouyer, Romain Brenguier, Nicolas Markey,...