Sciweavers

2583 search results - page 322 / 517
» On the Representation of Timed Polyhedra
Sort
View
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
15 years 10 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
ATAL
2006
Springer
15 years 10 months ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
CP
2006
Springer
15 years 10 months ago
Preprocessing QBF
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
Horst Samulowitz, Jessica Davies, Fahiem Bacchus
DAGM
2006
Springer
15 years 10 months ago
Shape Matching by Variational Computation of Geodesics on a Manifold
Abstract. Klassen et al. [9] recently developed a theoretical formulation to model shape dissimilarities by means of geodesics on appropriate spaces. They used the local geometry o...
Frank R. Schmidt, Michael Clausen, Daniel Cremers
ROBOCUP
2000
Springer
145views Robotics» more  ROBOCUP 2000»
15 years 10 months ago
Adaptive Path Planner for Highly Dynamic Environments
Abstract. This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes i...
Jacky Baltes, Nicholas Hildreth