Sciweavers

184 search results - page 31 / 37
» Restricted Strip Covering and the Sensor Cover Problem
Sort
View
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
15 years 10 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
ATAL
2008
Springer
14 years 11 months ago
Coalitional skill games
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
Yoram Bachrach, Jeffrey S. Rosenschein
BILDMED
2007
134views Algorithms» more  BILDMED 2007»
14 years 11 months ago
Improving Depth Perception in Medical AR
We present the in-situ visualization of medical data taken from CT or MRI scans in real-time using a video see-through head mounted display (HMD). One of the challenges to improve ...
Christoph Bichlmeier, Tobias Sielhorst, Sandro Mic...
COCOON
2005
Springer
15 years 3 months ago
Exploring Simple Grid Polygons
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
NETWORK
2008
107views more  NETWORK 2008»
14 years 9 months ago
HiCon: a hierarchical context monitoring and composition framework for next-generation context-aware services
This article presents a hierarchical context monitoring and composition framework that effectively supports next-generation context-aware services. The upcoming ubiquitous space w...
Kyungmin Cho, Inseok Hwang, Seungwoo Kang, Byoungj...