Sciweavers

1068 search results - page 158 / 214
» On Space Bounded Server Algorithms
Sort
View
PKDD
2009
Springer
137views Data Mining» more  PKDD 2009»
14 years 2 months ago
On Subgroup Discovery in Numerical Domains
Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discove...
Henrik Grosskreutz, Stefan Rüping
ICRA
2006
IEEE
123views Robotics» more  ICRA 2006»
14 years 2 months ago
Distributed Coverage with Multi-robot System
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...
Chan Sze Kong, Ai Peng New, Ioannis M. Rekleitis
3DIM
2005
IEEE
14 years 1 months ago
Multi-Resolution Modeling and Locally Refined Collision Detection for Haptic Interaction
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
Peiran Liu, Xiaojun Shen, Nicolas D. Georganas, Ge...
ESA
2003
Springer
106views Algorithms» more  ESA 2003»
14 years 1 months ago
Improved Competitive Guarantees for QoS Buffering
We consider a network providing Differentiated Services (DiffServ), which allow Internet Service Providers (ISP’s) to offer different levels of Quality of Service (QoS) to diffe...
Alexander Kesselman, Yishay Mansour, Rob van Stee
LCTRTS
1995
Springer
13 years 11 months ago
Scheduling of Hard Aperiodic Tasks in Hybrid Static/Dynamic Priority Systems
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
Jongwon Lee, Sungyoung Lee, Hyungill Kim