Sciweavers

4463 search results - page 566 / 893
» computer 2000
Sort
View
DIALM
2000
ACM
107views Algorithms» more  DIALM 2000»
15 years 8 months ago
Efficient memoryless protocol for tag identification
This paper presents an efficient collision resolution protocol and its variations for the tag identification problem, where an electromagnetic reader attempts to obtain within its...
Ching Law, Kayi Lee, Kai-Yeung Siu
165
Voted
ECAI
2000
Springer
15 years 8 months ago
Qualitative Spatial Reasoning about Line Segments
Abstract. Representing and reasoning about orientation information is an important aspect of qualitative spatial reasoning. We present a novel approach for dealing with intrinsic o...
Reinhard Moratz, Jochen Renz, Diedrich Wolter
115
Voted
ECAIW
2000
Springer
15 years 8 months ago
Cognition, Sociability, and Constraints
This paper focuses on the challenge of building technical agents that act flexibly in modern computing and information environments. Flexibility is approached in terms of both cogn...
Gerhard Weiß
127
Voted
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
15 years 8 months ago
Polygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 8 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann