Sciweavers

849 search results - page 71 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 8 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
JSAC
2007
109views more  JSAC 2007»
13 years 7 months ago
Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...
Yiming Zhang, Oliver W. W. Yang, Jing Wu, Michel S...
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 5 months ago
Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
Jerome Le Ny, George J. Pappas
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 2 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...
CHI
2002
ACM
14 years 8 months ago
Interactive 3D flow visualization using a streamrunner
Flow visualization in 3D is challenging due to perceptual problems such as occlusion, lack of directional cues, lack of depth cues, and visual complexity. In this paper we present...
Robert S. lramee