Sciweavers

2899 search results - page 89 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
HICSS
2003
IEEE
99views Biometrics» more  HICSS 2003»
15 years 6 months ago
Towards Feasible Topology Formation Algorithms for Bluetooth-based WPANs
In this paper, we tackle the problem of topology formation in Bluetooth Wireless Personal Area Networks (BTWPANs). We first overview and extend a previously proposed centralized ...
Carla-Fabiana Chiasserini, Marco Ajmone Marsan, El...
CIKM
2009
Springer
15 years 8 months ago
A mobile tourist assistance and recommendation system based on complex networks
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
Alf-Christian Schering, Martin Dueffer, Andreas Fi...
IWPEC
2009
Springer
15 years 8 months ago
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
Peter Damaschke
GMP
2006
IEEE
114views Solid Modeling» more  GMP 2006»
15 years 7 months ago
A Step Towards Automated Design of Side Actions in Injection Molding of Complex Parts
Side actions contribute to mold cost by resulting in an additional manufacturing and assembly cost as well as by increasing the molding cycle time. Therefore, generating shapes of ...
Ashis Gopal Banerjee, Satyandra K. Gupta
127
Voted
ECP
1997
Springer
125views Robotics» more  ECP 1997»
15 years 5 months ago
Possibilistic Planning: Representation and Complexity
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
Célia da Costa Pereira, Frédé...